QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#186850#6895. a-b Problemneko_nyaaAC ✓82ms5108kbC++14728b2023-09-24 12:34:102023-09-24 12:34:10

Judging History

你现在查看的是最新测评结果

  • [2023-09-24 12:34:10]
  • 评测
  • 测评结果:AC
  • 用时:82ms
  • 内存:5108kb
  • [2023-09-24 12:34:10]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define int long long

bool cmp(pair<int, int> a, pair<int, int> b) {
    return a.first + a.second > b.first + b.second;
}

void solve()
{
    int n;
    cin >> n;
    vector<pair<int, int>> p(n);
    for (int i = 0; i < n; i++)
    {
        cin >> p[i].first >> p[i].second;
    }

    sort(p.begin(), p.end(), cmp);
    int as = 0, bs = 0;
    for (int i = 0; i < n; i += 2)
    {
        as += p[i].first;
        if (i+1 < n) bs += p[i+1].second;
    }
    cout << as - bs << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 82ms
memory: 5108kb

input:

20
3
0 2
1 2
3 3
3
1 0
2 3
0 4
4
2 8
1 14
10 2
10 6
2
1 3
3 4
2
4 8
6 2
2
0 0
10 10
2
5 0
2 1
2
4 5
6 2
3
4 2
10 9
3 8
3
6 1
3 4
4 0
3
10 3
7 3
2 10
3
1 9
8 1
0 0
4
1 2
15 8
11 8
10 2
4
9 3
5 14
10 5
2 12
4
7 6
7 6
12 11
2 15
100000
3 1
10 8
1 8
7 9
3 6
9 2
0 7
1 3
7 1
2 0
10 9
2 5
0 3
6 1
9 0
1 1
1...

output:

1
-1
-2
0
2
10
4
2
6
6
7
0
15
-1
-2
-697
-24972584309703
24978641064563
42097360102
-61290555356

result:

ok 20 lines