제출 #1326538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326538		muhammad-mutahir	Sure Bet (CEOI17_sure)	C++20	0 / 100	0 ms	332 KiB

sure

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
const int N = 2e5+5;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n;
    long double a[n+1],b[n+1];
    for(int i = 1;i<=n;i++){
        cin>>a[i]>>b[i];
    }
    sort(a+1,a+n+1);
    reverse(a+1,a+n+1);
    sort(b+1,b+n+1);
    reverse(b+1,b+n+1);

    // print(a);
    // print(b);
    vector<long double>pra,pr;
    pr = pra = {0};
    for(int i = 1;i<=n;i++){
        pra.pb(pra.back()+a[i]);
        pr.pb(pr.back()+b[i]);
    }
    for(int i = 1;i<=n;i++){
        pra[i]-=i;
        pr[i]-=i;
    }
    // print(pra);
    // print(pr);
    long double ans = 0 ;
    int i =0 ;
    int j = 0;
    while(i<n and j<n){
        if(pra[i] <= pr[j]){
            i++;
        }
        else{
            j++;
        }
        ans = max(ans,min(pra[i]-j,pr[j]-i));
    }

    while(i<n){
        i++;
        ans = max(ans,min(pra[i]-j,pr[j]-i));
    }
    while(j<n){
        j++;
        ans = max(ans,min(pra[i]-j,pr[j]-i));
    }
    // printf("%.4lf",(double)ans);
    printf("%.4lf",(double) ans);

}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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