Submission #1159739

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159739		MPG	Sure Bet (CEOI17_sure)	C++20	100 / 100	55 ms	5300 KiB

sure

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long                           ll;
#define                                     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define                                     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
//#define                                     min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define                                     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define                                     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define                                     endl '\n'
#define                                     md(a) (a % mod + mod) % mod
#define pb push_back
//cout << setprecision(5) << fixed << f;
//hash prime = 769
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 400;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}



ll n;
double ps[2][maxn], asl[2][maxn], ans;
vector <double> arr[2];


void Solve(){

cin >> n;
for (int i = 1; i < n + 1; i++){
    cin >> asl[0][i] >> asl[1][i];
}
sort(asl[0] + 1, asl[0] + n + 1);
sort(asl[1] + 1, asl[1] + n + 1);

for (int i = n, j = 1; i > 0; i--, j++){
    ps[0][j] = ps[0][j - 1] + asl[0][i];
    ps[1][j] = ps[1][j - 1] + asl[1][i];
    arr[0].pb(ps[0][j]);
    arr[1].pb(ps[1][j]);
}
for (int i = 1; i < n + 1; i++){
    double jam = ps[0][i];
    ll x = lower_bound(arr[1].begin(), arr[1].end(), jam) - arr[1].begin();
    if (x < n){
        ans = max(ans, jam - (double)i - (double)x - (double)1);
    }
}

for (int i = 1; i < n + 1; i++){
    double jam = ps[1][i];
    ll x = lower_bound(arr[0].begin(), arr[0].end(), jam) - arr[0].begin();
    if (x < n){
        ans = max(ans, jam - (double)i - (double)x - (double)1);
    }
}
cout <<  setprecision(4) << fixed << ans << endl;



}





int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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