oj.uz

Submission #1027643

# Submission time Handle Problem Language Result Execution time Memory
1027643 2024-07-19T08:20:06 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define f first
#define s second

void solve(){
    int n;
    cin >> n;
    vector<double> a(n), b(n);
    double ans = 0;
    for(int i =  0; i < n; i++){
        cin >> a[i] >> b[i];
    }
    sort(a.rbegin(), a.rend());
    double x = 0, y = 0;
    int i = 0, j = 0, tu = 0;
    while(i < n && j < n){
        if(x <= y){
            x+=a[i];
            tu++;
            i++;
        }
        else{
            y+=b[j];
            tu++;
            j++;
        }
        ans=max(ans, min(x, y)-tu);
    }
    cout << fixed << setprecision(4) << ans << endl;
}   

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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