CF609A USB Flash Drives

༺Blog༒Hacker༻

已于 2022-07-17 12:52:58 修改

阅读量225

点赞数 12

分类专栏：算法 CF & UVA 文章标签：贪心算法算法 c++

于 2022-07-13 22:34:53 首次发布

本文链接：https://blog.csdn.net/HybridCOW_HORSE/article/details/125773826

版权

算法同时被 2 个专栏收录

86 篇文章 4 订阅

订阅专栏

CF & UVA

12 篇文章 2 订阅

订阅专栏

📋 个人简介

💖大家好，我是2022年3月份新人榜排名第三的 ༺Blog༒Hacker༻
🎉支持我：点赞👍+收藏⭐️+留言📝
💬格言：༺永做优质༒programmer༻
📣 系列专栏：CF & UVA🍁
📝 个人主页：༺Blog༒Hacker༻❄️

注（具体请见`CF665B Shopping`）:

⚜️我的更新时间会有所改变，每月2-5篇，感谢各位长期以来的支持！
在这里插入图片描述

📣CF609A USB Flash Drives

💠题目描述
🔆Sean is trying to save a large file to a USB flash drive. He has n USB flash drives with capacities equal to $a_{1},a_{2},...,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.

💠输入格式
🔆The first line contains positive integer $n (1 \leq n \leq 100) ——$ the number of USB flash drives.
🔆The second line contains positive integer $m ( 1≤m≤10^{5}) ——$ 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$ .

💠输出格式
🔆Print the minimum number of USB flash drives to write Sean’s file, if he can split the file between drives.

在这里插入图片描述
💠输入输出样例

➰输入 #1
3
5
2
1
3
➰输出 #1
2
➰输入 #2
3
6
2
3
2
➰输出 #2
3
➰输入 #3
2
5
5
10
➰输出 #3
1

💠说明/提示
♻️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.

思路

💠很简单的贪心➕模拟➕排序

💯CODE

#include<bits/stdc++.h>
#define ll long long
#define MAXN 1005
using namespace std;
ll n,m,a[MAXN],ans;
bool cmp(int x,int y)
{
    return x>y;
}
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=n;++i)
	{
		cin>>a[i];
		sort(a+1,a+1+n,cmp);
	}
	for(int i=1;i<=n;++i)
	{
		m-=a[i];
		ans++;
		if(m<=0)
		  break;
	}
	cout<<ans<<endl;
	return 0;
}