Codeforces Round #111 (Div. 2), problem: (A) Twins solution

Codeforces Round #111 (Div. 2), problem: (A) Twins: http://codeforces.com/problemset/problem/160/A

Codeforces Round #111 (Div. 2), problem: (A) Twins editorial: http://codeforces.com/blog/entry/4108

Codeforces Round #111 (Div. 2), problem: (A) Twins solution: http://ideone.com/Hc9hge

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
    int n, a[105], s=0, b=0, cnt=0;
    scanf("%d", &n);
    for(int i=0; i<n; i++) scanf("%d", &a[i]), s+=a[i];
    s>>=1;
    sort(a, a+n);
    for(int i=n-1; i>=0; i--) {
        b+=a[i], cnt++;
        if(b>s) break;
    }
    printf("%d", cnt);
    return 0;
}