Submission #1152461

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152461		KluydQ	Sure Bet (CEOI17_sure)	C++20	0 / 100	0 ms	328 KiB

sure

#include <bits/stdc++.h>
//#include "grader.h"
 
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N1 = 2e5 + 123;
 
int a[N1], b[N1], c[N1], n, m, k, z, w, ans, x, y, dp[N1];
vector <pii> v;

mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
void solve()
{
	cin >> n;
	
	FOR( i, 1, n, 1 )
	{
		double d1, d2;
		cin >> d1 >> d2;
		a[i] = d1 * 10000, b[i] = d2 * 10000;
	}
	sort( a + 1, a + n + 1 );
	sort( b + 1, b + n + 1 );
	reverse( a + 1, a + n + 1 );
	reverse( b + 1, b + n + 1 );
	
	int l = 0, r = 1e9;
	
	while( l <= r )
	{
		int md = l + r >> 1;
		int le = 0, ri = 0, suma = 0, sumb = 0;
		
		while( le <= n && ri <= n && min( suma, sumb ) < md )
		{
			if( suma < md && le < n ) le ++, suma -= 10000, sumb -= 10000, suma += a[le];
			if( sumb < md && ri < n ) ri ++, suma -= 10000, sumb -= 10000, sumb += b[ri];
			
			if( le == n && suma < md ) break;
			if( ri == n && sumb < md ) break;
		}
		if( suma >= md && sumb >= md ) l = md + 1, ans = md;
		else r = md - 1;
	}
	double d = ans;
	cout.precision(4);
	cout << fixed << d / (double)(10000);
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ  

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