160A. Twins

greedy, sortings, 900, https://codeforces.com/problemset/problem/160/A

思路：怎么全是一个pq能解决的问题

#include <iostream>
#include <queue>
using namespace std;

int main(){
    priority_queue<int> pq;
    int a,h=0;
    cin>>a;
    while(a--){
        int x;
        cin>>x;
        h+=x;
        pq.push(x);
    }
    int amount=0;
    int num=0;
    while(num<=h/2&&!pq.empty()){
        num+=pq.top();
        pq.pop();
        amount++;
    }
    cout<<amount<<'\n';
    return 0;
}