oj.uz

Submission #865669

# Submission time Handle Problem Language Result Execution time Memory
865669 2023-10-24T13:42:33 Z vjudge1 Sure Bet (CEOI17_sure) C++17
100 / 100
 66 ms 6968 KB 
/// tree bends in youth
/// 24  .10.2023
/// success is doing same thing in every single day!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N =2e5+ 5;
const ll NN =2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
const ll k = 316;
double z[N],x[N],pl[N],pr[N];
double pref[N];
void solve(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> z[i] >> x[i];
    }
    sort(z + 1,z + n + 1);
    sort(x + 1,x + n + 1);
    reverse(z + 1,z + n + 1);
    reverse(x + 1,x + n + 1);
    for(int i = 1 ; i <= n ; i ++){
        pref[i] = pref[i - 1] + x[i];
    }
    double mx = 0;
    double sumz = 0,l = 1;
    for(int i = 1 ; i <= n ; i ++){
        sumz += z[i];
        while(1){
            double sum = pref[int(l)];
            mx = max(mx,min(sumz,sum) - (l + i));
            //cout << i << " | " << l << " | " << sumz << " | " << sum << '\n';
            if(sum > sumz){
                break;
            }
            l ++;
        }
    }
    printf("%.4lf",(double)mx);
}
main (){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    ll abd= 1;
//    cin >> abd;
    for(ll i = 1;i <= abd;i++){
//        cout << "Case " << i << ":\n";
        solve();
    }
}

Compilation message

sure.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main (){
      | ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 3 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 3 ms 2532 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 58 ms 5188 KB Output is correct
18 Correct 58 ms 5244 KB Output is correct
19 Correct 59 ms 5204 KB Output is correct
20 Correct 59 ms 5204 KB Output is correct
21 Correct 60 ms 5200 KB Output is correct
22 Correct 57 ms 5248 KB Output is correct
23 Correct 58 ms 6740 KB Output is correct
24 Correct 60 ms 6736 KB Output is correct
25 Correct 58 ms 6740 KB Output is correct
26 Correct 66 ms 6968 KB Output is correct