Submission #110958

#	Time	Username	Problem	Language	Result	Execution time	Memory
110958		dndhk	Sure Bet (CEOI17_sure)	C++14	100 / 100	79 ms	3816 KiB

sure

#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N;
vector<double> v1, v2;
double ans = 0;

double used=0;
double s1=0, s2=0;

int main(){
	cin>>N;
	for(int i=0; i<N; i++){
		double x, y;
		scanf("%lf %lf", &x, &y);
		v1.pb(x); v2.pb(y);
	}
	sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end());
	while(!v1.empty() || !v2.empty()){
		used += 1.0;
		if(v1.empty()){
			s2+=v2.back(); v2.pop_back();
		}else if(v2.empty()){
			s1+=v1.back(); v1.pop_back();
		}else{
			if(s1<s2){
				s1+=v1.back(); v1.pop_back();
			}else{
				s2+=v2.back(); v2.pop_back();
			}
		}
		ans = max(ans, min(s1-used, s2-used));
	}
	printf("%.4lf", ans);
	return 0;
}

Compilation message (stderr)

sure.cpp: In function 'int main()':
sure.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf %lf", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~~~

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