Submission #866575

#TimeUsernameProblemLanguageResultExecution timeMemory
86657512345678Sure Bet (CEOI17_sure)C++17
100 / 100
74 ms3920 KiB
#include <bits/stdc++.h>

using namespace std;

int n;
double ans;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    vector<double> a(n), b(n);
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];
    sort(a.begin(), a.end()); reverse(a.begin(), a.end());
    sort(b.begin(), b.end()); reverse(b.begin(), b.end());
    for (int i=1; i<n; i++) a[i]+=a[i-1], b[i]+=b[i-1];
    for (int i=0; i<n; i++) 
    {
        if (a[i]>b[n-1]) continue;
        ans=max(ans, a[i]-(lower_bound(b.begin(), b.end(), a[i])-b.begin())-2-i);
    }
    for (int i=0; i<n; i++) 
    {
        if (b[i]>a[n-1]) continue;
        ans=max(ans, b[i]-(lower_bound(a.begin(), a.end(), b[i])-a.begin())-2-i);
    }
    printf("%.4lf", ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...