题解 | #成绩排序#
成绩排序
https://www.nowcoder.com/practice/3f27a0a5a59643a8abf0140b9a8cf1f7
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int MAXN = 100; struct Student { int id; int score; }; Student arr[MAXN]; bool Compare(Student a, Student b) { if (a.score == b.score) { return a.id < b.id; } else { return a.score < b.score; } } int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d%d", &arr[i].id, &arr[i].score); } sort(arr, arr + n, Compare); for(int i=0;i<n;i++){ cout<<arr[i].id<<" "<<arr[i].score<<endl; } return 0; }
考研复试机试 文章被收录于专栏
考研复试机试