oj.uz

Submission #676304

# Submission time Handle Problem Language Result Execution time Memory
676304 2022-12-30T08:47:07 Z vjudge1 Schools (IZhO13_school) C++17
5 / 100
 204 ms 13868 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 5;

/*
    i < j
    a[i] + b[j] > a[j] + b[i]
<=> a[i] - a[j] > b[i] - b[j]
--> just choose prefix
*/

int id[N];
int a[N], b[N];
int n, m, s;
int64_t pre[N], suf[N];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  cin >> n >> m >> s;

  for (int i = 1; i <= n; i++) {
    cin >> a[i] >> b[i];
  }

  sort(id + 1, id + n + 1, [&](int i, int j) {
    return a[i] - a[j] > b[i] - b[j];
  });

  {
    multiset<int> ss;
    int64_t cur = 0;
    for (int i = 1; i <= n; i++) {
      cur += a[i];
      ss.insert(a[i]);
      if (ss.size() > m) {
        cur -= *ss.begin();
        ss.erase(*ss.begin());
      }
      pre[i] = cur;
    }
  }

  {
    multiset<int> ss;
    int64_t cur = 0;
    for (int i = n; i >= 1; i--) {
      cur += b[i];
      ss.insert(b[i]);
      if (ss.size() > s) {
        cur -= *ss.begin();
        ss.erase(*ss.begin());
      }
      suf[i] = cur;
    }
  }

  int64_t best = 0;
  for (int i = m; i <= n - s; i++) {
    best = max(best, pre[i] + suf[i + 1]);
  }

  cout << best;

  return 0;
}

Compilation message

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

Subtask #1
5.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Incorrect 0 ms 340 KB Output isn't correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Incorrect 2 ms 468 KB Output isn't correct
8 Incorrect 2 ms 596 KB Output isn't correct
9 Incorrect 2 ms 596 KB Output isn't correct
10 Incorrect 2 ms 596 KB Output isn't correct
11 Incorrect 2 ms 596 KB Output isn't correct
12 Incorrect 2 ms 596 KB Output isn't correct
13 Incorrect 16 ms 2788 KB Output isn't correct
14 Incorrect 34 ms 3368 KB Output isn't correct
15 Incorrect 47 ms 4972 KB Output isn't correct
16 Incorrect 113 ms 12748 KB Output isn't correct
17 Incorrect 152 ms 11336 KB Output isn't correct
18 Incorrect 153 ms 11192 KB Output isn't correct
19 Incorrect 172 ms 12160 KB Output isn't correct
20 Incorrect 204 ms 13868 KB Output isn't correct