답안 #491006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491006 2021-11-30T03:35:52 Z duchung Sure Bet (CEOI17_sure) C++17
60 / 100
82 ms 1784 KB
#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 <= n)
        {
            sumA += a[++ptA];
        }
        else
        {
            sumB += b[++ptB];
        }
        ans = max(ans , min(sumA , sumB) - i);
    }
    cout << fixed << setprecision(4) << ans;
}
# 결과 실행 시간 메모리 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 2 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 2 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 76 ms 1768 KB Output is correct
18 Correct 75 ms 1784 KB Output is correct
19 Correct 66 ms 1776 KB Output is correct
20 Correct 82 ms 1764 KB Output is correct
21 Incorrect 73 ms 1768 KB Output isn't correct
22 Halted 0 ms 0 KB -