文章
79
粉丝
0
获赞
507
访问
20.0k
#include<iostream>
#include<algorithm>
using namespace std;
struct Student {
int id;
int score;
}s[110];
bool cmp(Student s1, Student s2) {
if (s1.score != s2.score)
return s1.score < s2.score;
return s1.id < s2.id;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> s[i].id >> s[i].score;
sort(s, s + n, cmp);
for (int i = 0; i < n; i ++ )
cout << s[i].id << ' ' << s[i].score << endl;
return 0;
}
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define x first
#define y second
typedef pair<int, int> PII;
vector<PII> v;
bool cmp(PII p1, PII p2) {
if (p1.y != p2.y)
return p1.y < p2.y;
return p1.x < p2.x;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i ++ ) {
int a, b;
cin >> a >> b;
v.pus...
登录后发布评论
暂无评论,来抢沙发