1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include<iostream>
#include<algorithm>
using namespace std;

int tab[1000000];

bool comp(int a, int b)
{
    return a > b;
}

int main()
{
    int n, suma = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> tab[i];
    }
    sort(tab, tab+n, comp);
    int x = tab[0], mini = tab[0];
    for(int i = 1; i < n; i++)
    {
       suma = suma + tab[i];
       if(suma >= mini)
       {
           suma = suma - mini;
           mini = mini*2;
           x++;

       }
    }
    cout << x;
}