oj.uz

답안 #949498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949498 2024-03-19T09:46:42 Z LOLOLO 학교 설립 (IZhO13_school) C++17
100 / 100
 98 ms 11632 KB 
#include <bits/stdc++.h>
typedef long long ll;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
 
using namespace std;
const int N = 4e5 + 100;
 
bool cmp(pair <int, int> A, pair <int, int> B) {
    return A.f - A.s > B.f - B.s;
}
 
ll pr[N], suff[N];
 
ll solve() {
    int n, m, s;
    cin >> n >> m >> s;
 
    vector <pair <int, int>> save;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        save.pb({a, b});
    }
 
    sort(all(save), cmp);
    priority_queue <ll, vector <ll>, greater <ll>> pq;
    ll sum = 0;
 
    for (int i = 0; i < n; i++) {
        pq.push(save[i].f);
        sum += save[i].f;
        while (sz(pq) > m) {
            sum -= pq.top();
            pq.pop();
        }
 
        pr[i] = sum;
    }
 
    while (sz(pq))
        pq.pop();
 
    sum = 0;
    for (int i = n - 1; i >= 0; i--) {
        pq.push(save[i].s);
        sum += save[i].s;
        while (sz(pq) > s) {
            sum -= pq.top();
            pq.pop();
        }
 
        suff[i] = sum;
    }
 
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        ans = max(ans, pr[i] + suff[i + 1]);
    }
 
    return ans;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        cout << solve() << '\n';
    }
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 3 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 2 ms 2628 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 13 ms 5464 KB Output is correct
14 Correct 25 ms 5588 KB Output is correct
15 Correct 44 ms 6088 KB Output is correct
16 Correct 54 ms 9160 KB Output is correct
17 Correct 72 ms 8672 KB Output is correct
18 Correct 86 ms 8900 KB Output is correct
19 Correct 86 ms 9412 KB Output is correct
20 Correct 98 ms 11632 KB Output is correct