| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1027653 |
2024-07-19T08:26:04 Z |
vjudge1 |
Sure Bet (CEOI17_sure) |
C++14 |
|
58 ms |
1884 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
void solve(){
int n;
cin >> n;
vector<double> a(n), b(n);
double ans = 0;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
double x = 0, y = 0;
int i = 0, j = 0, tu = 0;
while(i <= n && j <= n){
if(x <= y){
if(i >= n) break;
x+=a[i];
tu++;
i++;
}
else{
if(j >= n) break;
y+=b[j];
tu++;
j++;
}
ans=max(ans, min(x, y)-tu);
}
// printf("%.4lf",(double)ans)
cout << fixed << setprecision(4) << ans << endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
452 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
452 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
452 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
48 ms |
1884 KB |
Output is correct |
| 18 |
Correct |
49 ms |
1884 KB |
Output is correct |
| 19 |
Correct |
47 ms |
1884 KB |
Output is correct |
| 20 |
Correct |
48 ms |
1884 KB |
Output is correct |
| 21 |
Correct |
58 ms |
1884 KB |
Output is correct |
| 22 |
Correct |
48 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
47 ms |
1880 KB |
Output is correct |
| 24 |
Correct |
55 ms |
1884 KB |
Output is correct |
| 25 |
Correct |
48 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
50 ms |
1880 KB |
Output is correct |
