Codeforces Round #303 (Div. 2) 545 D. Queue Solution

Problem Link:   https://codeforces.com/contest/545/problem/D

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int n,i;

    cin>>n;

    int a[n+9];

    for(i=0; i<n; i++)

        cin>>a[i];

    sort(a,a+n);

    int s=0,cn=0,mx;

    mx=a[n-1];

    for(i=0; i<n; i++)

    {

        if(s<=a[i])

        {

            cn++;

            s+=a[i];

        }

    }

    cout<<cn<<endl;

}