Submission #298991

#	Time	Username	Problem	Language	Result	Execution time	Memory
298991		jbroeksteeg	Sure Bet (CEOI17_sure)	C++14	100 / 100	114 ms	5480 KiB

sure

#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
	if (c.size() == 0) {os << "{}"; return os;}
	os << "{" << c[0];
	for (int i = 1; i < (int)c.size(); i++) {os <<", "<<c[i];}
	os << "}";
	return os;
}

const int inf = 2e9;

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n; cin >> n;
	vector<pair<double,double>> people(n);
	
	vector<double> first, second;
	for (int i = 0; i < n; i++) {
		cin >> people[i].first >> people[i].second;
		first.push_back(people[i].first);
		second.push_back(people[i].second);
	}
	sort(first.begin(),first.end());
	sort(second.begin(),second.end());
	reverse(first.begin(),first.end());
	reverse(second.begin(),second.end());
	
	double ans = 0; // even
	
	double lSum=0,rSum=0;
	int l=0,r=0;
	while (l!=n||r!=n) {
		bool canFirst=l<n, canSecond=r<n;
		if (canFirst && canSecond) {
			if (lSum<=rSum) {
				lSum += first[l++];
			} else {
				rSum += second[r++];
			}
		} else if (canFirst) {
			lSum += first[l++]; 
		} else if (canSecond) {
			rSum += second[r++];	
		} else {
			assert(false);
		}
		pMax(ans, min(lSum, rSum) - l - r);
	}

	printf("%.4lf\n", (double)ans);
	
	return 0;
}

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