oj.uz

Submission #860926

# Submission time Handle Problem Language Result Execution time Memory
860926 2023-10-14T19:17:00 Z GordonRemzi007 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>

using namespace std;

bool srt(float a, float b) {
    return a > b;
}

int main() {
    int n, f = 0, s = 0;
    float fsum = 0, ssum = 0, res = 0;
    cin >> n;
    vector<float> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
    sort(a.begin(), a.end(), srt);
    sort(b.begin(), b.end(), srt);
    //Sa <= Sb
    while(f < n && s < n) {
        while(fsum <= ssum && f < n) {
            fsum+=a[f];
            f++;
            if(fsum <= ssum) {
                res = max(res, fsum-f-s);
            }
        }
        while(fsum > ssum && s < n) {
            ssum+=b[s];
            s++;
        }
        if(fsum <= ssum) res = max(res, fsum-f-s);
    }
    //Sb <= Sa
    f = 0, s = 0, fsum = 0, ssum = 0;
    while(f < n && s < n) {
        while(ssum <= fsum && s < n) {
            ssum+=b[s];
            s++;
            if(ssum <= fsum) res = max(res, ssum-f-s);
        }
        while(ssum > fsum && f < n) {
            fsum+=a[s];
            f++;
        }
        if(ssum <= fsum) res = max(res, ssum-f-s);
    }
    cout << fixed << setprecision(4) << res << "\n";
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 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 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -