제출 #1331919

#제출 시각아이디문제언어결과실행 시간메모리
1331919uranhishigSure Bet (CEOI17_sure)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
// #define int long long

int main() {
    int n;
    cin >> n;
    vector<double> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    sort(a.rbegin(), a.rend());
    sort(b.rbegin(), b.rend());
    double ans = 0;
    int l = 0, r = 0;
    double sa = 0, sb = 0, s = 0;
    while (l < n || r < n) {
        if ((sa < sb and l < n) || r >= n) {
            sa += a[l];
            s++;
            l++;
        } 
        else {
            sb += b[r];
            s++;
            r++;
        }
        ans = max(ans, min(sa, sb) - s);
    }
    cout << fixed << setprecision(9) << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...