zoukankan      html  css  js  c++  java
  • HDU 2124 Repair the Wall

    http://acm.hdu.edu.cn/showproblem.php?pid=2124

    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 ?
     
    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).
     
    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.
     
    Sample Input
    5 3
    3 2 1
    5 2
    2 1
     
    Sample Output
    2
    impossible
     
    时间复杂度:
    代码:
    #include <bits/stdc++.h>
    using namespace std;
    
    int L, n;
    int len[610];
    
    bool cmp(int x, int y) {
        return x > y;
    }
    
    int main() {
        while(~scanf("%d%d", &L, &n)) {
            int sum = 0, cnt = 0;
            for(int i = 1; i <= n; i ++)
                scanf("%d", &len[i]);
    
            sort(len + 1, len + 1 + n, cmp);
            while(sum < L && cnt <= n) {
                sum += len[cnt + 1];
                cnt ++;
            }
            if(cnt <= n)
                printf("%d
    ", cnt);
            else
                printf("impossible
    ");
        }
        return 0;
    }
    

      

  • 相关阅读:
    Delphi对接快递单的md5函数
    t+固定资产二维码打印工具2.01(支持微信查询)
    delphi 调用百度识别
    T+固定资产二维码卡片管理(外网版)
    Delphi 10.3.3 THTTPClient Post问题
    钉钉群机器人
    npm 命令集合
    php7的新特性
    ftp服务
    8.1 接口,接口也是一种类型
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9630449.html
Copyright © 2011-2022 走看看