版权声明:假装有个原创声明……虽然少许博文不属于完全原创,但也是自己辛辛苦苦总结的,转载请注明出处,感谢! https://blog.csdn.net/m0_37454852/article/details/88314239
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef struct Node
{
int id, grade;
}Node;
const int MAX = 110;
int N, cnt = 0;
Node S[MAX] = {0};
bool cmp(Node A, Node B)
{
if(A.grade != B.grade) return A.grade < B.grade;
return A.id < B.id;
}
int main()
{
while(scanf("%d", &N) != EOF)
{
for(int i=0; i<N; i++)
{
scanf("%d %d", &S[i].id, &S[i].grade);
}
sort(S, S+N, cmp);
for(int i=0; i<N; i++)
{
printf("%d %d\n", S[i].id, S[i].grade);
}
}
return 0;
}