Submission #865659

#	Time	Username	Problem	Language	Result	Execution time	Memory
865659		vjudge1	Sure Bet (CEOI17_sure)	C++17	0 / 100	1 ms	2396 KiB

sure

/// tree bends in youth
/// 24  .10.2023
/// success is doing same thing in every single day!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N =2e5+ 5;
const ll NN =2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
const ll k = 316;
double z[N],x[N],pl[N],pr[N];
void solve(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> z[i] >> x[i];
    }
    sort(z + 1,z + n + 1);
    sort(x + 1,x + n + 1);
    reverse(z + 1,z + n + 1);
    reverse(x + 1,x + n + 1);
    for(int i = 1;i <= n;i++){
        pr[i] = pr[i - 1] + z[i];
        pl[i] = pl[i - 1] + x[i];
    }
    double ans = 0;
    for(int i = 1;i <= n;i++){
        int l = 1,r = n;
        while(l < r){
            int mid = (l + r) / 2;
            if(pl[mid] >= pr[i])r = mid;
            else l = mid + 1;
        }
        double cnt = double(i) + double(l);
        double res = pr[i] - cnt;
        if(pl[l] < pr[i])break;
        ans = max(ans,res);
    }
    for(int i = 1;i<=n;i++){
        int l = 1,r = n;
        while(l < r){
            int mid = (l + r) / 2;
            if(pr[mid] > pl[i])r = mid;
            else l = mid + 1;
        }
        double cnt = double(i)+ double(l);
        double res = pl[i] - cnt;
        if(pr[l] < pl[i])break;
        ans = max(ans,res);
    }
    cout << ans;
}
main (){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    ll abd= 1;
//    cin >> abd;
    for(ll i = 1;i <= abd;i++){
//        cout << "Case " << i << ":\n";
        solve();
    }
}

Compilation message (stderr)

sure.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main (){
      | ^~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40