【清华大学考研机试题】成绩排序（查找和排序）

原题链接

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
using namespace std;

typedef struct Node
{
    int order;
    char name[50];
    int grade;
}Node;
Node S[1000] = {0};
int N, tag, grade;
char name[50];

bool cmp(Node A, Node B)
{
    if(A.grade != B.grade)
    {
        if(tag) return A.grade < B.grade;
        else return A.grade > B.grade;
    }
    return A.order < B.order;
}

int main()
{
    while(scanf("%d %d", &N, &tag) != EOF)
    {
        for(int i=0; i<N; i++)
        {
            scanf("%s %d", name, &grade);
            S[i].order = i, S[i].grade = grade;
            strcpy(S[i].name, name);
        }
        sort(S, S+N, cmp);
        for(int i=0; i<N; i++)
        {
            printf("%s %d\n", S[i].name, S[i].grade);
        }
    }
    return 0;
}