Submission #350003

#	Time	Username	Problem	Language	Result	Execution time	Memory
350003		knightron0	Sure Bet (CEOI17_sure)	C++14	100 / 100	116 ms	5584 KiB

sure

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long
#define printarray(arr, n) for(int i= 0;i<n;i++) cout<<arr[i]<<' '; cout<<endl;
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define initdp(a) memset(a, -1, sizeof(a));
#define endl '\n'
#define float long double

using namespace std;
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    vector<long double> a, b;
    for(int i = 0;i<n;i++){
    	long double t1, t2;
    	cin>>t1>>t2;
    	a.pb(t1);
    	b.pb(t2);
    }
    sort(all(a));
    reverse(all(a));
    sort(all(b));
    reverse(all(b));
    int i= 0; 
    int j= 0;
    long double suma = 0;
    long double sumb = 0;
    long double ans = (long double)-INF;
    while(i < n || j < n){
    	if(i == n){
    		sumb += b[j];
    		j++;
    		int taken = i+ j;
    		ans = max(ans, min(suma, sumb)-(long double)taken);
    		continue;
    	}
    	if(j == n){
    		suma += a[i];
    		i++;
    		int taken = i+ j;
    		ans = max(ans, min(suma, sumb)-(long double)taken);
    		continue;
    	}
    	if(sumb > suma){
    		suma += a[i];
    		i++;
    		int taken = i+ j;
    		ans = max(ans, min(suma, sumb)-(long double)taken);
    	} else if(sumb < suma){
    		sumb += b[j];
    		j++;
    		int taken = i+ j;
    		ans = max(ans, min(suma, sumb)-(long double)taken);
    	} else {
    		if(b[j] > a[i]){
    			sumb += b[j];
	    		j++;
	    		int taken = i+ j;
	    		ans = max(ans, min(suma, sumb)-(long double)taken);
    		} else {
    			suma += a[i];
	    		i++;
	    		int taken = i+ j;
	    		ans = max(ans, min(suma, sumb)-(long double)taken);
    		}
    	}
    }    
    ans = max(ans, (long double)0);
    cout<<fixed<<setprecision(4)<<ans<<endl;
    return 0;
}

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