【Educational Codeforces Round 3 A】【水题排序】USB Flash Drives 最少数量U盘存储m大小文件

本文主要是介绍【Educational Codeforces Round 3 A】【水题排序】USB Flash Drives 最少数量U盘存储m大小文件，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

Sean is trying to save a large file to a USB flash drive. He has n USB flash drives with capacities equal to a₁, a₂, ..., a_n megabytes. The file size is equal to m megabytes.

Find the minimum number of USB flash drives needed to write Sean's file, if he can split the file between drives.

Input

The first line contains positive integer n (1 ≤ n ≤ 100) — the number of USB flash drives.

The second line contains positive integer m (1 ≤ m ≤ 10⁵) — the size of Sean's file.

Each of the next n lines contains positive integer a_i (1 ≤ a_i ≤ 1000) — the sizes of USB flash drives in megabytes.

It is guaranteed that the answer exists, i. e. the sum of all a_i is not less than m.

Output

Print the minimum number of USB flash drives to write Sean's file, if he can split the file between drives.

Sample test(s) 
input 
3
5
2
1
3
output 
2
input 
3
6
2
3
2
output 
3
input 
2
5
5
10
output 
1

Note

In the first example Sean needs only two USB flash drives — the first and the third.

In the second example Sean needs all three USB flash drives.

In the third example Sean needs only one USB flash drive and he can use any available USB flash drive — the first or the second.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1,class T2>inline void gmax(T1 &a,T2 b){if(b>a)a=b;}
template <class T1,class T2>inline void gmin(T1 &a,T2 b){if(b<a)a=b;}
const int N=0,M=0,Z=1e9+7,ms63=0x3f3f3f3f;
int n,m;
int a[105];
int main()
{while(~scanf("%d%d",&n,&m)){for(int i=1;i<=n;++i)scanf("%d",&a[i]);sort(a+1,a+n+1);int sum=0;for(int i=1;i<=n;++i){sum+=a[n+1-i];if(sum>=m){printf("%d\n",i);break;}}}return 0;
}
/*
【题意】
给你n个usb flash drivers，
让你用最少数量的u盘，装下总大小为m的文件。【类型】
水题 排序*/

这篇关于【Educational Codeforces Round 3 A】【水题排序】USB Flash Drives 最少数量U盘存储m大小文件的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！