제출 #747185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
747185		anaduguleanu	Sure Bet (CEOI17_sure)	C++14	100 / 100	184 ms	3668 KiB

sure

#include <iostream>
#include <algorithm>
#include <iomanip>
#define MAX 100000
using namespace std;
///ifstream cin ("c.in");
///ofstream cout ("c.out");
double a[MAX + 10], b[MAX + 10];
bool cmp(double x, double y)
{
    return (x > y);
}
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i] >> b[i];
    sort(a + 1, a + n + 1, cmp);
    sort(b + 1, b + n + 1, cmp);
    int nA = 1, nB = 1;
    double A = 0, B = 0, ans = 0;
    for (int i = 1; i <= 2 * n; i++)
    {
        if (nA <= n && (nB == n + 1 || A < B))
        {
            A = A + a[nA];
            nA++;
        }
        else
        {
            B = B + b[nB];
            nB++;
        }
        ans = max(ans, min(A, B) - i);
    }
    cout << fixed << setprecision(4) << ans;
    return 0;
}

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