Submission #879268

#TimeUsernameProblemLanguageResultExecution timeMemory
879268vjudge1Sure Bet (CEOI17_sure)C++17
60 / 100
2057 ms3152 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++) for (int j=0; j<n; j++) ans=max(ans, min(a[i], b[j])-i-j-2);
        printf("%.4lf", ans);
    }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...