Submission #139711

#	Time	Username	Problem	Language	Result	Execution time	Memory
139711		RiscadoA	Sure Bet (CEOI17_sure)	C++14	100 / 100	227 ms	3684 KiB

sure

#include <bits/stdc++.h>

const int MAX_N = 100000;

int N;
double S[2][MAX_N];

inline double min(double a, double b)
{
	return a < b ? a : b;
}

int main()
{
	std::cin >> N;
	for (int i = 0; i < N; ++i)
		std::cin >> S[0][i] >> S[1][i];
	std::sort(std::begin(S[0]), std::begin(S[0]) + N, std::greater<double>());
	std::sort(std::begin(S[1]), std::begin(S[1]) + N, std::greater<double>());
	
	double best = 0.0;
	double a = 0.0, b = 0.0;
	for (int i = 0, j = 0;;) {
		if (i >= N && j >= N)
			break;
		else if ((i < N && a <= b) || j >= N) {
			a += S[0][i] - 1.0;
			b -= 1.0;
			i += 1;
		} else {
			b += S[1][j] - 1.0;
			a -= 1.0;
			j += 1;
		}
		if (min(a, b) > best)
			best = min(a, b);
	}

	printf("%.4lf", best);
	return 0;
}

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