oj.uz

Submission #767367

# Submission time Handle Problem Language Result Execution time Memory
767367 2023-06-26T17:08:54 Z raysh07 Sure Bet (CEOI17_sure) C++17
100 / 100
 74 ms 5960 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n; cin >> n;
    vector <double> a(n), b(n);
    for (int i = 0; i < n; i++){
        cin >> a[i] >> b[i];
    }
    
    sort(a.begin(), a.end(), greater<double>());
    sort(b.begin(), b.end(), greater<double>());
    
    vector <double> pa, pb;
    pa.push_back(0);
    pb.push_back(0);
    for (auto x : a) pa.push_back(pa.back() + x);
    for (auto x : b) pb.push_back(pb.back() + x);
    
    double ans = 0;
    for (int i = 0; i <= n; i++){
        int id = lower_bound(pb.begin(), pb.end(), pa[i]) - pb.begin();
        if (id > n) continue;
        ans = max(ans, pa[i] - i - id);
    }
    for (int i = 0; i <= n; i++){
        int id = lower_bound(pa.begin(), pa.end(), pb[i]) - pa.begin();
        if (id > n) continue;
        ans = max(ans, pb[i] - i - id);
    }
    
    cout << fixed << setprecision(4) << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 72 ms 5560 KB Output is correct
18 Correct 69 ms 5468 KB Output is correct
19 Correct 69 ms 5596 KB Output is correct
20 Correct 67 ms 5560 KB Output is correct
21 Correct 74 ms 5960 KB Output is correct
22 Correct 69 ms 5464 KB Output is correct
23 Correct 70 ms 5580 KB Output is correct
24 Correct 69 ms 5556 KB Output is correct
25 Correct 66 ms 5556 KB Output is correct
26 Correct 72 ms 5924 KB Output is correct