Bookshelf OpenJ_Bailian - 3406 (水题)

最新推荐文章于 2020-09-17 08:39:35 发布

Suprit

最新推荐文章于 2020-09-17 08:39:35 发布

阅读量308

点赞数

本文链接：https://blog.csdn.net/a1097304791/article/details/83065366

版权

https://vjudge.net/problem/OpenJ_Bailian-3406

水题

//Bookshelf
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;

const int maxn = 20010;
int cows[maxn], N, B;;
int main()
{
    cin >> N >>B;
    for(int i = 1; i <= N; i++)
        cin >> cows[i];
    sort(cows+1, cows+N+1);
    int ans = 0, sum = 0;
    for(int i = N; i >= 1; i--){
        sum += cows[i], ans++;
        if(sum >= B) break;
    }
    printf("%d\n",ans);
    return 0;
}