版权声明:假装有个原创声明……虽然少许博文不属于完全原创,但也是自己辛辛苦苦总结的,转载请注明出处,感谢! https://blog.csdn.net/m0_37454852/article/details/88311450
#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;
}