https://www.e-olymp.com/az/problems/1962

/*
    Author: Kanan Asgarli
    https://www.e-olymp.com/az/problems/1962
*/
#include <iostream>
#include <algorithm>
using namespace std;
int n, id[1000], bal[1000];
int main()
{
    cin>>n;
    for(int i = 0; i < n; i++)
        cin>>id[i]>>bal[i];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n-1; j++){
            if(bal[j] < bal[j+1]){
                swap(bal[j], bal[j+1]);
                swap(id[j], id[j+1]);
            }
            if(bal[j] == bal[j+1] && id[j] > id[j+1])
                swap(id[j], id[j+1]);
        }

    }
    for(int i = 0; i < n; i++)
        cout<<id[i]<<" "<<bal[i]<<endl;
    return 0;
}