oj.uz

Submission #468675

# Submission time Handle Problem Language Result Execution time Memory
468675 2021-08-29T10:18:27 Z wdjpng Sure Bet (CEOI17_sure) C++17
20 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
//#define double double
#define int long long
#define rep(i,n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()

using namespace std;

signed main()
{
    int n;
    cin>>n;

    vector<double>a(n),b(n);
    rep(i,n) cin>>a[i]>>b[i];

    sort(all(a));
    sort(all(b));
    reverse(all(a));
    reverse(all(b));

    double maxx = 0;
    int off = 2;
    vector<double>sum(2);
    vector<int>point(2,1);

    sum[0] = a[0];
    sum[1] = b[0];

    while(min(point[0], point[1])<n)
    {
        maxx=max(maxx, min(sum[0], sum[1])-off);
        if(point[0]==n||sum[0]>sum[1]) {
            sum[1]+=b[point[1]]; 
            point[1]++;
        }
        else {
            sum[0]+=a[point[0]]; 
            point[0]++;
        }
        off++;
    }
    maxx=max(maxx, min(sum[0], sum[1])-off);
    //cout<<(int)maxx<<".";
    //maxx-=(int)maxx;
    //rep(i,3) 
    //{
    //    maxx*=10;
    //    cout<<(int)maxx;
    //    maxx-=(int)maxx;
    //}
    //maxx*=10;
    //int o = (int)maxx;
    //if(1000*o+499<1000*maxx) o++;
    //cout<<o;
    printf("%.4lf",(double)maxx);
    //cout<<"\n";
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -