# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52651 | 2018-06-26T10:37:41 Z | snat123 | Sure Bet (CEOI17_sure) | C++14 | 3 ms | 488 KB |
#include<bits/stdc++.h> using namespace std; int main(){ //ios_base::sync_with_stdio(false); //cin.tie(NULL); int n; cin >> n; double a[n], b[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; long double x=0, y=0, res=0.0; while(i>=0 || j>=0){ if(x>=y || i<0){ y+=b[j--]; x-=1; y-=1; res=max(res, min(x, y)); } else{ x+=a[i--]; y-=1; x-=1; res=max(res, min(x, y)); } } printf("%.4lf", res); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 488 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 488 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 488 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |