1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
| #include <bits/stdc++.h>
using namespace std;
const int LEN = 1001;
struct Stu
{
int cn_, mt_, en_, sum_, idx_;
} arr[LEN];
bool cmp(Stu a, Stu b)
{
if (a.sum_ != b.sum_)
return a.sum_ > b.sum_;
else if (a.cn_ != b.cn_)
return a.cn_ > b.cn_;
return a.idx_ < b.idx_;
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> arr[i].cn_ >> arr[i].mt_ >> arr[i].en_;
arr[i].sum_ = arr[i].cn_ + arr[i].mt_ + arr[i].en_;
arr[i].idx_ = i + 1;
}
sort(arr, arr + n, cmp);
for (int i = 0; i < 5; ++i, cout << endl)
cout << arr[i].idx_ << " " << arr[i].sum_;
return 0;
}
|