답안 #491009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491009	2021-11-30T03:39:14 Z	duchung	Sure Bet (CEOI17_sure)	C++17	60 / 100	74 ms	1916 KB

sure

#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int n;
double a[N] , b[N];

int main()
{
    // freopen(".inp","r",stdin);
    // freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    for (int i = 1 ; i <= n ; ++i) cin >> a[i] >> b[i];
    sort(a + 1 , a + n + 1 , greater<double> {});
    sort(b + 1 , b + n + 1 , greater<double> {});

    double sumA = 0 , sumB = 0 , ans = 0;
    int ptA = 0 , ptB = 0;
    for (int i = 1 ; i <= 2 * n ; ++i)
    {
        if (sumA <= sumB && ptA + 1 <= n)
        {
            sumA += a[++ptA];
        }
        else
        {
            sumB += b[++ptB];
        }
        ans = max(ans , min(sumA , sumB) - i);
    }
    cout << fixed << setprecision(4) << ans;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	68 ms	1856 KB	Output is correct
18	Correct	68 ms	1916 KB	Output is correct
19	Correct	66 ms	1792 KB	Output is correct
20	Correct	67 ms	1856 KB	Output is correct
21	Incorrect	74 ms	1816 KB	Output isn't correct
22	Halted	0 ms	0 KB	-