oj.uz

답안 #444008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444008 2021-07-12T21:52:18 Z JovanB 학교 설립 (IZhO13_school) C++17
100 / 100
 191 ms 16236 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

const int MAXN = 300000;

pair <int, int> a[MAXN+5];

multiset <int> vals;

ll pref[MAXN+5];
ll suf[MAXN+5];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, m, s;
    cin >> n >> m >> s;
    for(int i=1; i<=n; i++){
        cin >> a[i].first >> a[i].second;
    }
    sort(a+1, a+1+n, [](pair <int, int> x, pair <int, int> y){ return x.first - x.second > y.first - y.second; });
    ll sum = 0;
    for(int i=1; i<=n; i++){
        if(vals.size() < m){
            vals.insert(a[i].first);
            sum += a[i].first;
        }
        else if(vals.size() && *vals.begin() < a[i].first){
            sum -= *vals.begin();
            vals.erase(vals.begin());
            vals.insert(a[i].first);
            sum += a[i].first;
        }
        pref[i] = sum;
    }
    sum = 0;
    vals.clear();
    for(int i=n; i>=1; i--){
        if(vals.size() < s){
            vals.insert(a[i].second);
            sum += a[i].second;
        }
        else if(vals.size() && *vals.begin() < a[i].second){
            sum -= *vals.begin();
            vals.erase(vals.begin());
            vals.insert(a[i].second);
            sum += a[i].second;
        }
        suf[i] = sum;
    }
    ll res = 0;
    for(int i=1; i<=n; i++) res = max(res, pref[i] + suf[i+1]);
    cout << res << "\n";
    return 0;
}

Compilation message

school.cpp: In function 'int main()':
school.cpp:29:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |         if(vals.size() < m){
      |            ~~~~~~~~~~~~^~~
school.cpp:44:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |         if(vals.size() < s){
      |            ~~~~~~~~~~~~^~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 19 ms 2976 KB Output is correct
14 Correct 37 ms 3972 KB Output is correct
15 Correct 51 ms 6012 KB Output is correct
16 Correct 133 ms 13944 KB Output is correct
17 Correct 176 ms 12908 KB Output is correct
18 Correct 154 ms 13032 KB Output is correct
19 Correct 179 ms 14140 KB Output is correct
20 Correct 191 ms 16236 KB Output is correct