HDOJ Repair the Wall JAVA 2124
来源:互联网 发布:霍华德生涯得分数据 编辑:程序博客网 时间:2024/06/01 09:26
简单贪心
没有什么难度的题
这都有同学看看不做的?
/** * *//** * @author Enron * */package _2124;import java.util.ArrayList;import java.util.Collections;import java.util.List;import java.util.Scanner;public class Main{public static void main(String[] args){Scanner sc = new Scanner(System.in);while(sc.hasNext()){int l = sc.nextInt();int n = sc.nextInt();List<Integer> list = new ArrayList<Integer>();int sum = 0;for (int i = 0; i < n; i++) {int a = sc.nextInt();sum += a;list.add(a);}if(sum<l) {System.out.println("impossible");continue;}Collections.sort(list);sum = 0;int ans = 0;for (int i = list.size()-1; i >=0 ; i--) {sum += list.get(i);ans++;if(sum >=l){System.out.println(ans);break;}}}}}
Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5087 Accepted Submission(s): 2461
Problem Description
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 ?
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 ?
Input
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<L<1000000000) and N(0<=N<600) which
mentioned above.
In the second line, there are N positive integers. The ith integer Ai(0<Ai<1000000000 ) means that the ith block has the size of 1×Ai (in inch).
Each test case contains two lines.
In the first line, there are two integers L(0<L<1000000000) and N(0<=N<600) which
mentioned above.
In the second line, there are N positive integers. The ith integer Ai(0<Ai<1000000000 ) means that the ith block has the size of 1×Ai (in inch).
Output
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.
If Kitty could not repair the wall, just print "impossible" instead.
Sample Input
5 33 2 15 22 1
Sample Output
2impossible
Author
linle
Source
HDU 2007-10 Programming Contest
阅读全文
0 0
- HDOJ Repair the Wall JAVA 2124
- HDOJ 2124 Repair the Wall
- hdoj 2124 Repair the Wall
- HDOJ 2124 Repair the Wall
- HDOJ 2124 Repair the Wall
- HDOJ-2124 Repair the Wall
- HDOJ 2124 Repair the Wall
- hdoj-【2124 Repair the Wall】
- hdoj 2124 Repair the Wall 【贪心】
- HDOJ-2124之Repair the Wall
- 2124:Repair the Wall
- HDOJ 2124 Repair the Wall(修城墙,贪心)
- hdoj 1010 Repair the Wall(贪心)
- hdu 2124 Repair the Wall
- HDU 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- hdu 2124 Repair the Wall
- ES6入门函数篇(一)之函数形参的默认值
- Vold源码分析
- NUIST OJ 1352 回顾 【差分】
- 折半排序
- 那些年mui webview遇到的坑
- HDOJ Repair the Wall JAVA 2124
- angular模糊查询和过滤修改
- Lambda Expressions(Sort)
- 服务端连接数据库
- C语言pojDNA字符串问题
- 【C++】动态规划方法以及Maximum Length of Repeated Subarray
- hook的LD_PRELOAD用法
- 替换空格:
- dokuwiki