제출 #1161913

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161913		Ludissey	Sure Bet (CEOI17_sure)	C++20	0 / 100	2093 ms	328 KiB

sure

#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;

const int MULT=10000;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; i++)
    {
        double _a,_b; cin >> _a >> _b;
        _a*=MULT;
        _b*=MULT;

        a[i]=_a-MULT;
        b[i]=_b-MULT;
    }
    sort(rall(a));
    sort(rall(b));
    int i=0;
    int j=0;
    int lsum=0;
    int rsum=0;
    int mn=0;
    while(i<n||j<n){
        if((lsum<rsum||(lsum==rsum&&a[i]<b[j]))&&i<n){
            lsum+=a[i];
            rsum-=MULT;
            i++;
        }else if(j<n){
            rsum+=b[j];
            lsum-=MULT;
            j++;
        }
        mn=max(min(lsum,rsum),mn);
    }
    
    double ans=(double)mn/(double)MULT;
    cout << setprecision(4) << fixed << ans << "\n";
    return 0;
}

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