Submission #498371

#	Time	Username	Problem	Language	Result	Execution time	Memory
498371		armashka	Sure Bet (CEOI17_sure)	C++17	0 / 100	0 ms	204 KiB

sure

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n;
double a[N], b[N];
 
const void solve(/*Armashka*/) {
	cin >> n;
	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);
	a[n + 1] = b[n + 1] = -1005.0;
	double ans = 0.0, sum1 = 0.0, sum2 = 0.0;	
	ll l1 = 1, l2 = 1;
	while (l1 <= n && l2 <= n) {
		if (fabs(sum1 + a[l1] - sum2) < fabs(sum2 + b[l2] - sum1)) {
			sum1 += a[l1];
			++ l1;
		} else {
			sum2 += b[l2];
			++ l2;
		}
		ans = max(ans, min(sum1 - (l1 + l2 - 2), sum2 - (l1 + l2 - 2)));
	}		
	cout << fixed << setprecision(4) << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
	//cin >> tt;
    while (tt --) {                                                             
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

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