oj.uz

Submission #683001

# Submission time Handle Problem Language Result Execution time Memory
683001 2023-01-17T13:18:48 Z smartmonky Schools (IZhO13_school) C++14
100 / 100
 182 ms 15004 KB 
#include <bits/stdc++.h>

#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

const int  N = (int)3e5+7;

int p[N], p2[N];
bool comp(pair <int,int> a, pair <int,int> b){
    return a.ff - a.ss > b.ff - b.ss;
}
main(){
	ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, s;
    cin >> n >> m >> s;
    vector <pair <int,int> > vp(n);
    for(int i = 0; i < n; i++){
        cin >> vp[i].ff >> vp[i].ss;
    }
    sort(all(vp), comp);
    multiset <int> st;
    int sum = 0;
    for(int i = 0; i < n; i++){
        sum += vp[i].ff;
        st.insert(vp[i].ff);
        if(st.size() > m){
            sum -= *(st.begin());
            st.erase(st.begin());
        }
        p[i] = sum;
    }
    st.clear();
    sum = 0;
     for(int i = n - 1; i >= 1; i--){
        sum += vp[i].ss;
        st.insert(vp[i].ss);
        if(st.size() > s){
            sum -= *(st.begin());
            st.erase(st.begin());
        }
        p2[i] = sum;
    }
    int ans = 0;
    for(int i = m - 1; i < n - s; i++){
        ans = max(ans, p[i] + p2[i + 1]);
    }
    cout << ans;
}

Compilation message

school.cpp:18:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main(){
      | ^~~~
school.cpp: In function 'int main()':
school.cpp:33:22: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   33 |         if(st.size() > m){
      |            ~~~~~~~~~~^~~
school.cpp:44:22: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   44 |         if(st.size() > s){
      |            ~~~~~~~~~~^~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 656 KB Output is correct
13 Correct 16 ms 2900 KB Output is correct
14 Correct 33 ms 3724 KB Output is correct
15 Correct 52 ms 5580 KB Output is correct
16 Correct 121 ms 13372 KB Output is correct
17 Correct 136 ms 12108 KB Output is correct
18 Correct 140 ms 12152 KB Output is correct
19 Correct 182 ms 13232 KB Output is correct
20 Correct 177 ms 15004 KB Output is correct