제출 #570922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570922		nttt	Sure Bet (CEOI17_sure)	C++14	100 / 100	86 ms	3216 KiB

sure

#include<bits/stdc++.h>
using namespace std;
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x >> (i)) & 1)
#define fi first
#define se second
#define ll long long
#define task "name" 

const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int MOD = 1e9 + 7;
const int N = 1e5 + 3;
const int BASE = 10;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b) {a = b; return true;} return false;
}

int n;
double a[N], b[N];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    sort(a + 1, a + 1 + n, greater<double>());
    sort(b + 1, b + 1 + n, greater<double>());
    double sum_a = 0, sum_b = 0, ans = 0;
    int i = 1, j = 1;
    while(i <= n || j <= n)
    {
        if(i <= n && sum_a <= sum_b) sum_a += a[i++];
        else if(j <= n && sum_b < sum_a) sum_b += b[j++];
        else break;
        maximize(ans, min(sum_a, sum_b) - i - j + 2);
    }
    cout << fixed << setprecision(4) << ans;
    return 0;
}

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