# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
52676 |
2018-06-26T11:01:02 Z |
snat123 |
Sure Bet (CEOI17_sure) |
C++14 |
|
163 ms |
2152 KB |
#include<bits/stdc++.h>
using namespace std;
double a[100001], b[100001];
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++) cin >> a[i] >> b[i];
sort(a, a+n);
sort(b, b+n);
int i=n-1, j=n-1;
double x=0.0, y=0.0, res=0.0;
while(i>=0 || j>=0){
if(j>=0 && x>y) y+=b[j--];
else x+=a[i--];
res=max(res, min(x, y)-(n-i)-(n-j)+2);
}
printf("%.4lf", res);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
472 KB |
Output is correct |
3 |
Correct |
2 ms |
472 KB |
Output is correct |
4 |
Correct |
2 ms |
472 KB |
Output is correct |
5 |
Correct |
4 ms |
484 KB |
Output is correct |
6 |
Correct |
2 ms |
508 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
472 KB |
Output is correct |
3 |
Correct |
2 ms |
472 KB |
Output is correct |
4 |
Correct |
2 ms |
472 KB |
Output is correct |
5 |
Correct |
4 ms |
484 KB |
Output is correct |
6 |
Correct |
2 ms |
508 KB |
Output is correct |
7 |
Correct |
2 ms |
508 KB |
Output is correct |
8 |
Correct |
3 ms |
508 KB |
Output is correct |
9 |
Correct |
2 ms |
552 KB |
Output is correct |
10 |
Correct |
3 ms |
568 KB |
Output is correct |
11 |
Correct |
2 ms |
612 KB |
Output is correct |
12 |
Correct |
3 ms |
612 KB |
Output is correct |
13 |
Correct |
4 ms |
616 KB |
Output is correct |
14 |
Correct |
3 ms |
616 KB |
Output is correct |
15 |
Correct |
4 ms |
616 KB |
Output is correct |
16 |
Correct |
5 ms |
616 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
472 KB |
Output is correct |
3 |
Correct |
2 ms |
472 KB |
Output is correct |
4 |
Correct |
2 ms |
472 KB |
Output is correct |
5 |
Correct |
4 ms |
484 KB |
Output is correct |
6 |
Correct |
2 ms |
508 KB |
Output is correct |
7 |
Correct |
2 ms |
508 KB |
Output is correct |
8 |
Correct |
3 ms |
508 KB |
Output is correct |
9 |
Correct |
2 ms |
552 KB |
Output is correct |
10 |
Correct |
3 ms |
568 KB |
Output is correct |
11 |
Correct |
2 ms |
612 KB |
Output is correct |
12 |
Correct |
3 ms |
612 KB |
Output is correct |
13 |
Correct |
4 ms |
616 KB |
Output is correct |
14 |
Correct |
3 ms |
616 KB |
Output is correct |
15 |
Correct |
4 ms |
616 KB |
Output is correct |
16 |
Correct |
5 ms |
616 KB |
Output is correct |
17 |
Correct |
159 ms |
2084 KB |
Output is correct |
18 |
Correct |
162 ms |
2152 KB |
Output is correct |
19 |
Correct |
163 ms |
2152 KB |
Output is correct |
20 |
Incorrect |
156 ms |
2152 KB |
Output isn't correct |
21 |
Halted |
0 ms |
0 KB |
- |