oj.uz

Submission #659552

# Submission time Handle Problem Language Result Execution time Memory
659552 2022-11-18T13:39:39 Z jiahng Sure Bet (CEOI17_sure) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 2000010
#define INF (ll)1e18
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;


int N,A[maxn],B[maxn],dp[maxn];
double a,b;
int ssA[maxn], ssB[maxn];
int32_t main(){
    cin >> N;
    FOR(i,1,N){
        cin >> a >> b;
        A[i] = a * 10000;
        B[i] = b * 10000;
    }
    sort(A+1,A+N+1,greater <int>()); sort(B+1,B+N+1,greater <int>());
    FOR(i,1,N) ssA[i] = ssA[i-1] + A[i];
    FOR(i,1,N) ssB[i] = ssB[i-1] + B[i];
    int ans = 0;
    FOR(i,1,N){
        int y = lower_bound(ssB+1,ssB+N+1,ssA[i]) - ssB;
        if (y == N+1) continue;
        ans = max(ans, ssA[i] - (i + y) * 10000);
    }
    FOR(i,1,N){
        int x = lower_bound(ssA+1,ssA+N+1,ssB[i]) - ssA;
        if (x == N+1) continue;
        ans = max(ans, ssB[i] - (i + x)*10000);
    }
    double lans = ans; lans /= 10000;
    printf("%.4lf", (double)lans);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -