#include <iostream> 
using namespace std;
struct Node
{ int data; Node *next;};
struct Queue
{
    int size;
    Node *first;
    Node *last;
};
void Creation(Queue *Q)
{
    Q->first = new Node;
    Q->first->next = NULL;
    Q->last = Q->first;
    Q->size = 0;
}
int Top(Queue *Q)
{
    return Q->first->next->data;
}
 
void Add(Queue *Q)
{
    int value;
    cout << "Znachenie -> ";
    cin >> value;
    Q->last->next = new Node;
    Q->last = Q->last->next;
    Q->last->data = value;
    Q->last->next = NULL;
    Q->size++;
    cout << "Element dobavlen\n";
}
int Size(Queue *Q)
{
    return Q->size;
}
 
void PrintOcher(Queue *Q)
{
    Node *X = Q->first->next;
    while(X)
    {
        cout << X->data << "=>";
        X = X->next;
    }
    cout << endl;
}
void UdMinEl(Queue *Q)
{
    Node *X = Q->first->next;
    int n = 0, pm=0, nm=0, min1 = X->data, min2 = X->data; 
    X = X->next;
    while(X)
    {
        n++;
        if(X->data < min1)
        {
            pm = n + 1;
            nm = n + 2;
            min1 = X->data;
            min2 = X->data;
        }
        X = X->next;
    }
    Node *X1=Q->first->next;
    for(int i = 1; i <= pm; i++)
      X1 = X1->next;
    X1->data = min2;
   X1 = Q->first->next;
    for(int i = 1; i <= nm; i++)
       X1 = X1->next;
     X1->data = min1;
}
int main()
{
    Queue Q;
    Creation(&Q);
    int n;
    cout << "Введіть кількість елементів - ";
    cin >> n;
    cout << "Введіть елементи черги\n";
    for(int i = 1; i <=n; i++)
    {
        Add(&Q);
    }
    cout << "*** Черга***\n";
    PrintOcher(&Q);
    UdMinEl(&Q);
    cout << "***Черга після перестановки***\n";
    PrintOcher(&Q);
    system("pause");
    return 0;
}

void UdMinEl(Queue *Q)
{
    Node *X = Q->first->next;
    int n = 0, pm=0, nm=0, min1 = X->data, min2 = X->data; 
    X = X->next;
    while(X)
    {
        n++;
        if(X->data < min1)
        {
            pm = n + 1;
            nm = n + 2;
            min1 = X->data;
            min2 = X->data;
        }
        X = X->next;
    }
    Node *X1=Q->first->next;
    for(int i = 1; i <= pm; i++)
      X1 = X1->next;
    X1->data = min2;
   X1 = Q->first->next;
    for(int i = 1; i <= nm; i++)
       X1 = X1->next;
     X1->data = min1;
}