545D - Queue

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <queue>
using namespace std;

int main() {
    int n,aux,ans=0,sum=0;
    cin>>n;
    priority_queue<int,vector<int>, greater<int> > q;
    for (int i=0;i<n;i++){
        cin>>aux;
        q.push(aux);
    }
    while(!q.empty()){
        aux=q.top();
        //cout<<aux<<' ';
        if (sum<=aux){
            ans++;
            sum+=aux;
        }
        q.pop();
    }
    cout<<endl;
    cout<<ans<<endl;
    return 0;
}