제출 #219223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
219223		Fasho	Sure Bet (CEOI17_sure)	C++14	100 / 100	174 ms	8568 KiB

sure

#include <bits/stdc++.h>
#define N 1000005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;

long double m,ar[N],sum,t,a[N],b[N],prefa[N],prefb[N];
ll n;
bool srt(long double x,long double y)
{
	return x>y;
}

int main()
{
	fast;
	cin>>n;
	fo(i,1,n)
	cin>>a[i]>>b[i];
	sort(a+1,a+n+1,srt);
	sort(b+1,b+n+1,srt);
	fo(i,1,n)
		prefa[i]=prefa[i-1]+a[i];
	fo(i,1,n)
		prefb[i]=prefb[i-1]+b[i];
	int l=0,r=0;
	while(l<=n && r<=n)
	{
		long double x=min(prefa[l],prefb[r]);
		// cout<<x<<sp<<l<<sp<<r<<endl;
		sum=max(sum,x-l-r);
		if(prefa[l]>prefb[r])
			r++;
		else
			l++;

	}
	cout<<fixed<<setprecision(4)<<sum;
}

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