【清华大学考研机试题】成绩排序

原题链接

#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;
}