oj.uz

답안 #886735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886735 2023-12-12T18:12:39 Z aykhn Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
 
// author : aykhn
 
using namespace std;
typedef long long ll;
 
#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define bpcll __builtin_popcountll
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define int ll
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F
 
void _()
{
    int n;
    cin >> n;
    int a[n], b[n];
    int res = 0;
    for (int i = 0; i < n; i++) 
    {
        double x, y;
        cin >> x >> y;
        a[i] = x * 10000 + 0.5;
        b[i] = y * 10000 + 0.5;
    }
    sort(a, a + n, greater<int> ());
    sort(b, b + n, greater<int> ());
    int i = 0;
    int j = 0;
    int sum1 = 0, sum2 = 0;
    while (i < n || j < n)
    {
        if (i == n) sum2 += b[j++];
        else if (j == n) sum1 += a[i++];
        else if (sum1 <= sum2) sum1 += a[i++];
        else sum2 += b[j++];
        res = max(res, min(sum2, sum1) - i * 10000 - j * 10000);
    }
    cout << res/10000 << '.' << res%10000 << '\n';
}
 
signed main()
{
    int t = 1;
    // cin >> t;
    for (int tt = 0; tt < t; tt++)
    {
        _();
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -