oj.uz

답안 #676305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676305 2022-12-30T08:47:55 Z vjudge1 학교 설립 (IZhO13_school) C++17
5 / 100
 229 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];
  }

  iota(id + 1, id + n + 1, 1);
  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:39:21: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |       if (ss.size() > m) {
      |           ~~~~~~~~~~^~~
school.cpp:53:21: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |       if (ss.size() > s) {
      |           ~~~~~~~~~~^~~

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Correct 0 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 3 ms 596 KB Output isn't correct
12 Incorrect 3 ms 596 KB Output isn't correct
13 Incorrect 18 ms 2772 KB Output isn't correct
14 Incorrect 39 ms 3412 KB Output isn't correct
15 Incorrect 58 ms 4948 KB Output isn't correct
16 Incorrect 121 ms 12544 KB Output isn't correct
17 Incorrect 163 ms 11284 KB Output isn't correct
18 Incorrect 169 ms 11216 KB Output isn't correct
19 Incorrect 186 ms 12192 KB Output isn't correct
20 Incorrect 229 ms 13868 KB Output isn't correct