Submission #843000

#	Time	Username	Problem	Language	Result	Execution time	Memory
843000		vjudge1	Sure Bet (CEOI17_sure)	C++17	60 / 100	2045 ms	4688 KiB

sure

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
double ans, a[N], b[N], fa[N], fb[N];
int n;
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    sort (a + 1, a + n + 1);
    sort (b + 1, b + n + 1);
    for (int i = n; i >= 1; i--)
    {
        fa[n - i + 1] = fa[n - i] + a[i];
        fb[n - i + 1] = fb[n - i] + b[i];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            ans = max (ans, min (fa[i], fb[j]) - i - j);
    printf("%.4lf",(double) ans);
}

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 0 / 40