답안 #609720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
609720	2022-07-27T19:49:08 Z	MasterTaster	Sure Bet (CEOI17_sure)	C++14	60 / 100	101 ms	3676 KB

sure

#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 100010

using namespace std;

int n;
long double ress=0, a[MAXN], b[MAXN];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n;
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];

    sort(a, a+n, greater<long double>());
    sort(b, b+n, greater<long double>());

    long double aa=0, bb=0;
    int i=0, j=0;
    while (i<n || j<n)
    {
        if (i==n || bb<=aa)
        {
            bb+=b[j++];
        }
        else if (j==n || aa<bb)
        {
            aa+=a[i++];
        }

        aa--; bb--;
        ress=max(ress, min(aa, bb));
    }
    cout<<fixed<<showpoint<<setprecision(4)<<ress<<endl;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	2 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	2 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	79 ms	3452 KB	Output is correct
18	Correct	77 ms	3336 KB	Output is correct
19	Correct	77 ms	3676 KB	Output is correct
20	Correct	82 ms	3324 KB	Output is correct
21	Incorrect	101 ms	3404 KB	Output isn't correct
22	Halted	0 ms	0 KB	-