oj.uz

답안 #934510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934510 2024-02-27T13:27:54 Z Amirreza_Fakhri Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 2396 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 1e5+5;

int n;
double a[maxn], b[maxn], pa[maxn], pb[maxn];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cout << fixed << setprecision(4);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
    sort(a, a+n), sort(b, b+n);
    reverse(a, a+n), reverse(b, b+n);
    for (int i = 0; i < n; i++) {
        pa[i] = a[i], pb[i] = b[i];
        if (i) pa[i] += pa[i-1], pb[i] += pb[i-1];
    }
    double ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            double cost = i+j+2;
            if (pa[i] < pb[j]) smax(ans, min(pa[i]-cost, pb[j]-cost));
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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