oj.uz

Submission #176003

# Submission time Handle Problem Language Result Execution time Memory
176003 2020-01-07T14:20:38 Z emil_physmath Schools (IZhO13_school) C++17
100 / 100
 274 ms 17272 KB 
// #define DEBUG
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
typedef long long llong;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n, aNum, bNum;
    cin >> n >> aNum >> bNum;
    struct City
    {
        int a, b;
    };
    vector<City> cities(n);
    for (int i = 0; i < n; ++i)
        cin >> cities[i].a >> cities[i].b;
    if (!aNum)
    {
        sort(cities.begin(), cities.end(), [](const City& lhs, const City& rhs) {
             return lhs.b > rhs.b;
        });
        long long ans = 0;
        for (int i = 0; i < bNum; ++i)
            ans += cities[i].b;
        cout << ans;
        exit(0);
    }
    if (!bNum)
    {
        sort(cities.begin(), cities.end(), [](const City& lhs, const City& rhs) {
             return lhs.a > rhs.a;
        });
        long long ans = 0;
        for (int i = 0; i < aNum; ++i)
            ans += cities[i].a;
        cout << ans;
        exit(0);
    }
    sort(cities.begin(), cities.end(), [](const City& lhs, const City& rhs) {
         return lhs.a - lhs.b > rhs.a - rhs.b;
    });
    vector<long long> pref(n, -30'000'000'000LL), suff(n, -30'000'000'000LL);
    multiset<int> a;
    long long sum = 0;
    for (int i = 0; i < aNum; ++i)
    {
        a.insert(cities[i].a);
        sum += cities[i].a;
    }
    pref[aNum - 1] = sum;
    for (int i = aNum; i < n; ++i)
    {
        sum += cities[i].a;
        a.insert(cities[i].a);
        sum -= *a.begin();
        a.erase(a.begin());
        pref[i] = sum;
    }
    sum = 0;
    multiset<int> b;
    for (int i = 1; i <= bNum; ++i)
    {
        b.insert(cities[n - i].b);
        sum += cities[n - i].b;
    }
    suff[n - bNum] = sum;
    for (int i = bNum + 1; i <= n; ++i)
    {
        sum += cities[n - i].b;
        b.insert(cities[n - i].b);
        sum -= *b.begin();
        b.erase(b.begin());
        suff[n - i] = sum;
    }
    long long ans = 0;
    for (int i = 0; i + 1 < n; ++i)
        ans = max(ans, pref[i] + suff[i + 1]);
    cout << ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 5 ms 732 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 5 ms 632 KB Output is correct
12 Correct 5 ms 632 KB Output is correct
13 Correct 28 ms 2680 KB Output is correct
14 Correct 49 ms 3576 KB Output is correct
15 Correct 75 ms 4344 KB Output is correct
16 Correct 186 ms 12920 KB Output is correct
17 Correct 201 ms 14456 KB Output is correct
18 Correct 224 ms 14216 KB Output is correct
19 Correct 233 ms 15480 KB Output is correct
20 Correct 274 ms 17272 KB Output is correct