Submission #570791

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
570791	2022-05-31T09:48:03 Z	duytuandao21	Sure Bet (CEOI17_sure)	C++17	60 / 100	2000 ms	3356 KB

sure

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N = 2e6+7;
int n;
double a[N], b[N], prefixSumA[N], prefixSumB[N], res = 0;
int main()
{
	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>());
	for(int i=1;i<=n;i++) {
		prefixSumA[i] = prefixSumA[i-1] + a[i];
		prefixSumB[i] = prefixSumB[i-1] + b[i];

	}
	for(int i=1;i<=2*n;i++) {
		for(int j=0;j<=i;j++) {
			double va1 = prefixSumA[j];
			double va2 = prefixSumB[i-j];
			res = max(res, min(va1 - i, va2 - i));
		}
	}
	printf("%.4lf",(double)res);
	return 0;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct

Subtask #2

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	4 ms	340 KB	Output is correct
13	Correct	4 ms	340 KB	Output is correct
14	Correct	4 ms	340 KB	Output is correct
15	Correct	4 ms	340 KB	Output is correct
16	Correct	4 ms	340 KB	Output is correct

Subtask #3

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	4 ms	340 KB	Output is correct
13	Correct	4 ms	340 KB	Output is correct
14	Correct	4 ms	340 KB	Output is correct
15	Correct	4 ms	340 KB	Output is correct
16	Correct	4 ms	340 KB	Output is correct
17	Execution timed out	2060 ms	3356 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-