제출 #45081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45081		qoo2p5	Sure Bet (CEOI17_sure)	C++17	60 / 100	2061 ms	5324 KiB

sure

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back

bool mini(auto &x, const auto &y) {
	if (y < x) {
		x = y;
		return 1;
	}
	return 0;
}

bool maxi(auto &x, const auto &y) {
	if (y > x) {
		x = y;
		return 1;
	}
	return 0;
}

void run();

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	run();
	return 0;
}

const int N = (int) 1e5 + 123;

int n;
ld a[N], b[N];

void run() {
	cin >> n;
	rep(i, 1, n + 1) {
		cin >> a[i] >> b[i];
	}
	sort(a + 1, a + n + 1);
	reverse(a + 1, a + n + 1);
	sort(b + 1, b + n + 1);
	reverse(b + 1, b + n + 1);
	rep(i, 1, n + 1) {
		a[i] += a[i - 1];
		b[i] += b[i - 1];
	}
	
	ld ans = 0;
	
	rep(i, 0, n + 1) {
		rep(j, 0, n + 1) {
			maxi(ans, min(a[i], b[j]) - (i + j));
		}
	}
	
	cout << fixed << setprecision(4);
	cout << ans << "\n";
}

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