简单的桶排序。
CODE:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair
#define nMax 160010
#define eps 1e-8
#define inf 0x7fffffff
int n,a,b;
typedef vector<int> VI;
VI s[110];
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif
while(~scanf("%d",&n)){
FOR(i,0,100) s[i].clear();
FOR(i,1,n) scanf("%d%d",&a,&b),s[b].pb(a);
DOR(i,100,0) if(s[i].size()) FOR(j,0,s[i].size()-1) printf("%d %d\n",s[i][j],i);
}
return 0;
}