'commit'
This commit is contained in:
33
TangDou/LanQiaoBei/LanQiao14STEMA202212/3.cpp
Normal file
33
TangDou/LanQiaoBei/LanQiao14STEMA202212/3.cpp
Normal file
@@ -0,0 +1,33 @@
|
||||
#include <bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
/*
|
||||
3
|
||||
3 84
|
||||
1 87
|
||||
2 84
|
||||
|
||||
输出样例
|
||||
1 87
|
||||
2 84
|
||||
3 84
|
||||
|
||||
*/
|
||||
const int N = 1010;
|
||||
struct Node {
|
||||
int id;
|
||||
int score;
|
||||
const bool operator<(const Node &b) const {
|
||||
if (score == b.score) return id < b.id;
|
||||
return score > b.score;
|
||||
}
|
||||
} a[N];
|
||||
int main() {
|
||||
int n;
|
||||
cin >> n;
|
||||
for (int i = 1; i <= n; i++) cin >> a[i].id >> a[i].score;
|
||||
sort(a + 1, a + 1 + n);
|
||||
|
||||
for (int i = 1; i <= n; i++) printf("%d %d\n", a[i].id, a[i].score);
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user