P2676. Bookshelf B

考点

  • 排序

题解

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
#include <bits/stdc++.h>

using namespace std;

const int LEN = 20050;

int arr[LEN];

int main()
{
ios::sync_with_stdio(false);
int n, b, cnt = 0, sum = 0;
cin >> n >> b;
for (int i = 0; i < n; ++i)
cin >> arr[i];
sort(arr, arr + n, [](int a, int b) -> bool
{ return a > b; });
for (int i = 0; i < n && sum < b; ++i)
{
sum += arr[i];
++cnt;
}
cout << cnt;
return 0;
}

思路

没有别的坑点,排序结束后累加即可