Submission #1722192

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

ll a[100001];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	sort(a,a+n);
	reverse(a,a+n);
	int lo = 1; int hi = n;
	int ans=0;
	while(lo<=hi)
	{
		int mid=(lo+hi)>>1;
		ll sum = 0;
		for(int i=mid-1;i<n;i++) sum+=a[i];
		bool pos=1;
		for(int i=mid-2;i>=0;i--)
		{
			if(a[i]<=2LL*sum)
			{
				sum+=a[i];
			}
			else
			{
				pos=false;break;
			}
		}
		if(pos)
		{
			lo=mid+1;
			ans=mid;
		}
		else
		{
			hi=mid-1;
		}
	}
	cout<<ans<<'\n';
}

Submission Info

Judge Result