Submission #1283077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283077		Jawad_Akbar_JJ	Sure Bet (CEOI17_sure)	C++17	100 / 100	86 ms	1980 KiB

sure

#include <iostream>
#include <algorithm>

using namespace std;
double a[1<<17], b[1<<17], M1, M2, s1, s2, Ans;

int main(){
	int n;
	cin>>n;

	for (int i=1;i<=n;i++)
		cin>>a[i]>>b[i];

	sort(a + 1, a + n + 1);
	sort(b + 1, b + n + 1);

	int i1 = n, i2 = n;
	while (i1 + i2){
		if (!!i1 and s1 <= s2)
			s1 += a[i1--];
		else if (!!i2)
			s2 += b[i2--];
		else
			i1 = i2 = 0;
		Ans = max(Ans, min(s1, s2) - (n + n - i1 - i2));
	}

	printf("%.4lf\n", Ans);
}

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