Submission #1200942

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200942		PlayVoltz	Sure Bet (CEOI17_sure)	C++20	100 / 100	57 ms	3656 KiB

sure

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, c=0;
	long double suma=0, sumb=0, ans=0;
	cin>>n;
	deque<long double> a(n), b(n);
	for (int i=0; i<n; ++i)cin>>a[i]>>b[i];
	sort(a.begin(), a.end(), greater<long double>());
	sort(b.begin(), b.end(), greater<long double>());
	while (a.size()+b.size()){
		if (!a.size())sumb+=b[0], ++c, b.pop_front();
		else if (!b.size())suma+=a[0], ++c, a.pop_front();
		else{
			if (suma<sumb)suma+=a[0], ++c, a.pop_front();
			else sumb+=b[0], ++c, b.pop_front();
		}
		ans=max(ans, min(suma, sumb)-c);
	}
	cout<<fixed<<setprecision(4)<<ans;
}

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