제출 #230491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230491		islingr	Sure Bet (CEOI17_sure)	C++14	100 / 100	158 ms	5240 KiB

sure

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(x, v) for (auto &x : v)

#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()

using ld = long double;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n; cin >> n;
	vector<ld> a(n + 1), b(n + 1);
	a[0] = b[0] = 1e6;
	rep(i, 0, n) cin >> a[i + 1] >> b[i + 1];
	sort(rall(a)); sort(rall(b));
	a[0] = b[0] = 0;
	rep(i, 0, n) a[i + 1] += a[i], b[i + 1] += b[i];
	auto f = [&](int x, int y) -> ld {
		return min(a[x], b[y]) - x - y;
	};
	ld ans = 0;
	rep(x, 0, n + 1) {
		int l = 0, r = n;
		while (r - l >= 5) {
			int mid = l + (r - l) / 2;
			if (f(x, mid) < f(x, mid + 1))
				l = mid;
			else r = mid + 1;
		}
		rep(i, l + 1, r + 1) if (f(x, l) < f(x, i)) l = i;
		ans = max(ans, f(x, l));
	}
	cout << fixed << setprecision(4) << ans;
}

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