Submission #1135678

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135678		steveonalex	Schools (IZhO13_school)	C++20	100 / 100	87 ms	11520 KiB

school

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, char separator = ' ', char finish = '\n'){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
bool compare(pair<long, long> a, pair<long, long> b){
    return a.first + b.second > b.first + a.second;
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    long a, b, n; cin >> n >> a >> b;
    vector<pair<long, long>> people(n);
    for(long i = 0; i<n; ++i){
        long x, y; cin >> x >> y;
        people[i] = {x, y};
    }
    people.push_back({0, -1e18});
    people.push_back({-1e18, 0});
    sort(ALL(people), compare);
 
    n = people.size();
 
    vector<ll> sum_a(n, -1e18), sum_b(n, -1e18);
    priority_queue<long, vector<long>, greater<long>> pq;
    ll sum = 0;
    for(long i = 0; i<n; ++i){
        sum += people[i].first;
        pq.push(people[i].first);
        while(pq.size() > a){
            sum -= pq.top();
            pq.pop();
        }
        if (pq.size() == a) sum_a[i] = sum;
    }
 
    sum = 0; while(pq.size()) pq.pop();
    for(long i = n-1; i>=0; --i){
        sum += people[i].second;
        pq.push(people[i].second);
        while(pq.size() > b){
            sum -= pq.top();
            pq.pop();
        }
        if (pq.size() == b) sum_b[i] = sum;
    }
 
    ll ans = -1e18;
    for(long i = 0; i<n-1; ++i)
        maximize(ans, sum_a[i] + sum_b[i+1]);
    cout << ans << "\n";
 
    return 0;
}

• Subtask 1: 100 / 100