oj.uz

답안 #866574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866574 2023-10-26T12:24:27 Z 12345678 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
double ans;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    vector<double> a(n), b(n);
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];
    sort(a.begin(), a.end()); reverse(a.begin(), a.end());
    sort(b.begin(), b.end()); reverse(b.begin(), b.end());
    for (int i=1; i<n; i++) a[i]+=a[i-1], b[i]+=b[i-1];
    for (int i=0; i<n; i++) ans=max(ans, a[i]-(lower_bound(b.begin(), b.end(), a[i])-b.begin())-2-i);
    for (int i=0; i<n; i++) ans=max(ans, b[i]-(lower_bound(a.begin(), a.end(), b[i])-a.begin())-2-i);
    printf("%.4lf", ans);
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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