#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

//struct
struct myDegree {
    int node;
    int degree;
};

bool mycompare(myDegree s1, myDegree s2){
   return s1.degree < s2.degree;
}

int main()
{
    myDegree degree[4];

    //input
    degree[0].node = 1;
    degree[0].degree = 15;
    degree[1].node = 2;
    degree[1].degree = 9;
    degree[2].node = 3;
    degree[2].degree = 20;
    degree[3].node = 4;
    degree[3].degree = 11;

    //output
    for (myDegree s : degree) {
        cout << s.node << " " << s.degree << endl;
    }
     cout<<endl;

//    // sort
    sort(degree, degree+4, mycompare);

    // output
    for (myDegree s : degree) {
        cout << s.node << " " << s.degree << endl;
    }
    cout<<endl;

    int a1;
    cin>>a1;

    return 0;
}