# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
52655 |
2018-06-26T10:42:12 Z |
snat123 |
Sure Bet (CEOI17_sure) |
C++14 |
|
3 ms |
616 KB |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
double tmp;
long long a[n], b[n], x=0, y=0, res=0;
for(int i=0; i<n; i++) {
cin >> tmp;
a[i]=tmp*10000;
cin >> tmp;
b[i]=tmp*10000;
}
sort(a, a+n);
sort(b, b+n);
int i=n-1, j=n-1;
while(i>=0 || j>=0){
if(x>y || i<0) y+=b[j--];
else x+=a[i--];
x-=10000;
y-=10000;
//cout << x << " " << y << endl;
res=max(res, min(x, y));
}
long double ans=(1.0*res/10000);
cout << fixed << setprecision(4) << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
416 KB |
Output is correct |
4 |
Correct |
2 ms |
428 KB |
Output is correct |
5 |
Correct |
3 ms |
616 KB |
Output is correct |
6 |
Incorrect |
3 ms |
616 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
416 KB |
Output is correct |
4 |
Correct |
2 ms |
428 KB |
Output is correct |
5 |
Correct |
3 ms |
616 KB |
Output is correct |
6 |
Incorrect |
3 ms |
616 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
416 KB |
Output is correct |
4 |
Correct |
2 ms |
428 KB |
Output is correct |
5 |
Correct |
3 ms |
616 KB |
Output is correct |
6 |
Incorrect |
3 ms |
616 KB |
Output isn't correct |