oj.uz

Submission #706512

# Submission time Handle Problem Language Result Execution time Memory
706512 2023-03-06T20:36:56 Z mychecksedad Sure Bet (CEOI17_sure) C++17
100 / 100
 77 ms 3576 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, K = 20;

int n;
double a[N], b[N];
void solve(){
  cin >> n;
  for(int i = 0; i < n; ++i) cin >> a[i] >> b[i];
  sort(a, a+n, greater<double>());
  sort(b, b+n, greater<double>());

  double best = 0, x = 0, y = 0, s = 0;
  int j = 0;
  for(int i = 0; i < n; ++i){
    x += a[i];
    s += 1;
    while(j < n && min(x, y + b[j]) - s - 1 >= min(x, y) - s){
      y += b[j];
      s += 1;
      best = max(best, min(x, y) - s);
      j++;
    }  
    best = max(best, min(x, y) - s);
  }
  cout << fixed << setprecision(4);
  cout << best;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
    cout << '\n';
  }
  return 0;
 
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:40:14: warning: unused variable 'aa' [-Wunused-variable]
   40 |   int T = 1, aa;
      |              ^~

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 69 ms 3256 KB Output is correct
18 Correct 69 ms 3248 KB Output is correct
19 Correct 65 ms 3132 KB Output is correct
20 Correct 67 ms 3248 KB Output is correct
21 Correct 74 ms 3532 KB Output is correct
22 Correct 77 ms 3228 KB Output is correct
23 Correct 72 ms 3248 KB Output is correct
24 Correct 73 ms 3136 KB Output is correct
25 Correct 67 ms 3260 KB Output is correct
26 Correct 72 ms 3576 KB Output is correct