oj.uz

Submission #493171

# Submission time Handle Problem Language Result Execution time Memory
493171 2021-12-10T09:30:34 Z MilosMilutinovic Sure Bet (CEOI17_sure) C++14
60 / 100
 2000 ms 5584 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<double> a(n), b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  vector<int> order_a(n);
  iota(order_a.begin(), order_a.end(), 0);
  sort(order_a.begin(), order_a.end(), [&](int i, int j) {
    return a[i] > a[j];
  });
  vector<int> order_b(n);
  iota(order_b.begin(), order_b.end(), 0);
  sort(order_b.begin(), order_b.end(), [&](int i, int j) {
    return b[i] > b[j];
  });
  vector<double> pref_a(n + 1);
  vector<double> pref_b(n + 1);
  for (int i = 0; i < n; i++) {
    pref_a[i + 1] = pref_a[i] + a[order_a[i]];
    pref_b[i + 1] = pref_b[i] + b[order_b[i]];
  }
  double ans = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      ans = max(ans, min(pref_a[i] - (i + j), pref_b[j] - (i + j)));
    }
  }
  cout << fixed << setprecision(4) << ans << '\n';
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 2 ms 324 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 2 ms 324 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Execution timed out 2074 ms 5584 KB Time limit exceeded
18 Halted 0 ms 0 KB -