| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 920192 |
2024-02-02T08:28:23 Z |
Alihan_8 |
Sure Bet (CEOI17_sure) |
C++17 |
|
74 ms |
8028 KB |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long
using i64 = long long;
template <class F, class _S>
bool chmin(F &u, const _S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
template <class F, class _S>
bool chmax(F &u, const _S &v){
bool flag = false;
if ( u < v ){
u = v; flag |= true;
}
return flag;
}
#define double long double
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n; cin >> n;
vector <double> a(n), b(n);
for ( int i = 0; i < n; i++ ){
cin >> a[i] >> b[i];
}
sort(all(a), greater <double> ());
sort(all(b), greater <double> ());
b.pb(0), a.pb(0);
vector <double> pf(n + 1);
for ( int i = 0; i < n; i++ ){
pf[i + 1] = pf[i] + b[i];
}
int j = 0;
double opt = 0, cnt = 0, mx = 0;
for ( int i = 0; i <= n; i++ ){
while ( j <= n && pf[j] <= cnt ){
chmax(mx, pf[j] - j);
j++;
}
chmax(opt, mx - i);
if ( j <= n ){
chmax(opt, cnt - (i + j));
}
cnt += a[i];
}
cout << fixed << setprecision(4) << opt;
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
600 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
600 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 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 |
344 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 |
344 KB |
Output is correct |
| 3 |
Correct |
1 ms |
600 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 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 |
344 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
68 ms |
6376 KB |
Output is correct |
| 18 |
Correct |
68 ms |
8028 KB |
Output is correct |
| 19 |
Correct |
71 ms |
6996 KB |
Output is correct |
| 20 |
Correct |
70 ms |
7736 KB |
Output is correct |
| 21 |
Correct |
73 ms |
7988 KB |
Output is correct |
| 22 |
Correct |
69 ms |
7500 KB |
Output is correct |
| 23 |
Correct |
70 ms |
7772 KB |
Output is correct |
| 24 |
Correct |
69 ms |
7704 KB |
Output is correct |
| 25 |
Correct |
70 ms |
7776 KB |
Output is correct |
| 26 |
Correct |
74 ms |
7988 KB |
Output is correct |
