HackerRank Sorting 2.Mark and Toys

題目連結：Mark and Toys | HackerRank

用Greedy，小的先放

int maximumToys(vector<int> ps, int k){
    sort(ps.begin(),ps.end());
    int sum=0,ct=0;
    for(auto a:ps){
        if(sum+a<k){
            sum+=a;
            ct++;
        }else break;
    }
    return ct;
}