제출 #58103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58103		Benq	학교 설립 (IZhO13_school)	C++14	100 / 100	177 ms	26060 KiB

school

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 300005;

int N,M,S;
ll ansS[MX], ansM[MX];
vpi v;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> S;
    F0R(i,N) {
        int A,B; cin >> A >> B;
        v.pb({A,B});
    }
    sort(all(v),[](pi a, pi b){ return a.f-a.s < b.f-b.s; });
    priority_queue<int,vi,greater<int>> pq;
    ll sum = 0;
    F0R(i,N) {
        pq.push(v[i].s); sum += v[i].s;
        if (sz(pq) > S) { sum -= pq.top(); pq.pop(); }
        ansS[i+1] = sum;
    }
    while (sz(pq)) pq.pop();
    sum = 0;
    F0Rd(i,N) {
        pq.push(v[i].f); sum += v[i].f;
        if (sz(pq) > M) { sum -= pq.top(); pq.pop(); }
        ansM[i] = sum;
    }
    ll ans = 0;
    F0R(i,N+1) ans = max(ans,ansS[i]+ansM[i]);
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

• Subtask 1: 100 / 100