【每日一题9】AcWing 429. 奖学金

发表于 更新于 分类于 Valine：
本文字数： 81 阅读时长 ≈ 1 分钟

Day9 AcWing 429. 奖学金

思路

  1. 重载小于号
  2. 自定义比较函数
  3. lambda表达式写法

拓展

  1. T160509 C - 志愿者

代码

重载小于号
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
36
37
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 310;

int n;
struct Person
{
    int id, sum, a, b, c;
    bool operator< (const Person& t) const
    {
        if (sum != t.sum) return sum > t.sum;
        if (a != t.a) return a > t.a;
        return id < t.id;
    }
}q[N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
    {
        int a, b, c;
        cin >> a >> b >> c;
        q[i] = {i, a + b + c, a, b, c};
    }

    sort(q + 1, q + n + 1);

    for (int i = 1; i <= 5; i ++ )
        cout << q[i].id << ' ' << q[i].sum << endl;

    return 0;
}
自定义比较函数
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
36
37
38
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 310;

int n;
struct Person
{
    int id, sum, a, b, c;
}q[N];

bool cmp(Person& a, Person& b)
{
    if (a.sum != b.sum) return a.sum > b.sum;
    if (a.a != b.a) return a.a > b.a;
    return a.id < b.id;
}

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
    {
        int a, b, c;
        cin >> a >> b >> c;
        q[i] = {i, a + b + c, a, b, c};
    }

    sort(q + 1, q + n + 1, cmp);

    for (int i = 1; i <= 5; i ++ )
        cout << q[i].id << ' ' << q[i].sum << endl;

    return 0;
}
lambda表达式写法
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
36
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 310;

int n;
struct Person
{
    int id, sum, a, b, c;

}q[N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
    {
        int a, b, c;
        cin >> a >> b >> c;
        q[i] = {i, a + b + c, a, b, c};
    }

    sort(q + 1, q + n + 1, [](Person& a, Person& b) {
        if (a.sum != b.sum) return a.sum > b.sum;
        if (a.a != b.a) return a.a > b.a;
        return a.id < b.id;
    });

    for (int i = 1; i <= 5; i ++ )
        cout << q[i].id << ' ' << q[i].sum << endl;

    return 0;
}