제출 #197403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197403		Juney	Sure Bet (CEOI17_sure)	C++14	100 / 100	106 ms	3756 KiB

sure

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5 + 5;

int N;
double A[MAXN], B[MAXN], ans;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> N;
	for(int i=1; i<=N; i++) cin >> A[i] >> B[i];
	sort(A+1, A+1+N, greater<double>()); sort(B+1, B+1+N, greater<double>());
	int a = 0, b = 0;
	double sum1 = 0, sum2 = 0;
	for(int i=1; i<=2*N; i++) {
		if(a == N) sum2 += B[++b];
		else if(b == N) sum1 += A[++a];
		else {
			if(sum1 < sum2) sum1 += A[++a];
			else sum2 += B[++b];
		}
		ans = max(ans, min(sum1, sum2) - i);
	}
	printf("%.4lf", ans);
}

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