[codeup 2132] Repair the Wall

问题 D: 2132 Repair the Wall

题目描述

Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.
When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty’s walls were made of wood.
One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repaired perfectly, without any gap.
Now, Kitty knew the size of each blocks, and wanted to use as fewer as possible of the blocks to repair the wall, could you help her ?

输入
The problem contains many test cases, please process to the end of file( EOF ).
Each test case contains two lines.
In the first line, there are two integers L[0,1000000000] and N, 0<=N<600 which mentioned above.
In the second line, there are N positive integers. The ith integer Ai(0~000000000 ) means that the ith block has the size of 1×Ai (in inch).

输出
For each test case , print an integer which represents the minimal number of blocks are needed.
If Kitty could not repair the wall, just print “impossible” instead.

样例输入

2 2
12 11
14 3
27 11 4
109 5
38 15 6 21 32
5 3
1 1 1

样例输出

1
1
5
impossible

#include <iostream>
#include <algorithm>
using namespace std;bool cmp(int a, int b) {return a > b;
}
int main() {int L, N;while(cin>>L >> N) {int a[N] = {0};for (int i = 0; i < N; i++) {cin>> a[i];}sort(a, a+N, cmp);for (int i = 0; i < N; i++) {if (a[i] > L) {cout<<i+1<<endl;L -= a[i];break;}else {L -= a[i];}}if (L > 0) cout<<"impossible"<<endl;}return 0;
}

[codeup 2132] Repair the Wall相关推荐

XYNUOJ 1246: Repair the Wall 贪心水题酒馆浪人的博客
这道题完全就是大水题 1246: Repair the Wall 时间限制: 1 Sec 内存限制: 32 MB 提交: 26 解决: 13 [ 提交 ][ 状态 ][ 讨论版 ] 题 ...
codeup墓地目录（算法笔记习题刷题笔记）
在线codeup contest 地址:http://codeup.cn/contest.php Contest100000575 - <算法笔记>3.1小节--入门模拟->简单模拟 ...
codeup墓地目录
代码内容为原创C++ 在线codeup contest 地址:http://codeup.cn/contest.php Contest100000575 - <算法笔记>3.1小节--入门 ...
算法笔记CodeUp第一至第六章刷题记录
文章目录 <算法笔记>2.2小节--C/C++快速入门->顺序结构 1.例题1-1-1 按要求输出信息(1) 2.例题1-1-2 按要求输出信息(2) 3.例题1-2-1 求两个整数 ...
高德地图API POI分类编码表（mysql版）
高德地图API POI分类编码表(mysql版) 编码表更新时间:2017年8月10日注意:本编码表为高德地图自定义编码格式,数据会根据行政区划变动不定期进行更新. sql文件下载地址: h ...
269道各路算法考试题集锦
1 某编程大赛题(35道题,中等难度) 1.在实际的开发工作中,对于string的处理是最常见的编程任务,本题是要求程序对用户输入的string进行处理,具体要求如下: 1.每个单词的首字母变为大写. ...
Java解惑电子书
--表达式谜题 Java 谜题 1--表达式谜题谜题 1:奇数性下面的方法意图确定它那唯一的参数是否是一个奇数.这个方法能够正确运转吗? public static boolean isOdd( ...
【POJ1113】Wall（凸包）
[题目] Description Once upon a time there was a greedy King who ordered his chief Architect to build a ...
BZOJ 2132 圈地计划（最小割）【BZOJ 修复工程】
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划题目链接 https://hydro.ac/d/bzoj/p/2132 是 hydro 的 BZOJ ...
mysql之基础操作grant、show、repair、log_error等
grant all on databasename.tablename to 'username'@'xxx.xxx.xxx.xxx' identified by 'complexpassword'; ...

[codeup 2132] Repair the Wall

问题 D: 2132 Repair the Wall

[codeup 2132] Repair the Wall相关推荐

最新文章

热门文章