Submission #1156758

---

Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
#include<functional>
#include<boost/optional.hpp>

template<class T>using p_queue = std::priority_queue<T, std::vector<T>, std::greater<>>;

int main()
{
	p_queue<std::uint64_t> queue;
	std::uint64_t N;
	std::cin >> N ;
	for (int i{}; i < N; ++i) 
	{
		std::uint64_t v;
		std::cin >> v;
		queue.emplace(v);
	}
	int count = 1;
	std::uint64_t now = queue.top();
	queue.pop();
	while (queue.size())
	{
		auto top = queue.top();
		queue.pop();
		if (2 * now < top)
		{
			count = 1;
		}
		else
		{
			++count;
		}
		now += top;
	}
	std::cout << count << std::endl;
}

Submission Info

Judge Result