21 lines
464 B
C++
21 lines
464 B
C++
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
const int N=110;
|
|
struct Node {
|
|
int id;
|
|
int fen;
|
|
bool operator<(const Node &t) {
|
|
if (fen == t.fen) return id < t.id;
|
|
return fen > t.fen;
|
|
}
|
|
} a[N];
|
|
|
|
|
|
int main() {
|
|
int n;
|
|
cin >> n;
|
|
for (int i = 1; i <= n; i++) cin >> a[i].id >> a[i].fen;
|
|
sort(a+1, a + n+1);
|
|
for (int i = 1; i <= n; i++) cout << a[i].id << " " << a[i].fen << endl;
|
|
return 0;
|
|
} |