oj.uz

Submission #38947

# Submission time Handle Problem Language Result Execution time Memory
38947 2018-01-08T09:55:50 Z grumpy_gordon Schools (IZhO13_school) C++14
0 / 100
 0 ms 6864 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5 + 100, inf = 1e9 + 100;

int a[maxn], b[maxn], n, M, S;

pair<int, int> q[maxn];

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> M >> S;
  for (int i = 0; i < n; i++)
    cin >> b[i] >> a[i], q[i] = make_pair(a[i] - b[i], i);
  sort(q, q + n);
  int ans = 0;
  for (int i = 0; i < M; i++)
	ans += b[q[i].second];
  for (int i = 0; i < S; i++)
	ans += a[q[n - i - 1].second];
  cout << ans;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6864 KB Output is correct
2 Correct 0 ms 6864 KB Output is correct
3 Correct 0 ms 6864 KB Output is correct
4 Incorrect 0 ms 6864 KB Output isn't correct
5 Halted 0 ms 0 KB -