zoukankan      html  css  js  c++  java
  • HDU2124 Repair the Wall(贪心)

    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
    

    Author

    linle

    Source

    HDU 2007-10 Programming Contest 
    #include<stdio.h>
    #include<string.h>
    #include<math.h>
    #include<stdlib.h>
    #include<algorithm>
    using namespace std;
    const int maxn=600+10;
    bool cmp(int a,int b)
    {
        return a>b;
    }
    int main()
    {
        int len,n,i,res;
        int a[maxn];
        while(scanf("%d%d",&len,&n)!=EOF)
        {
            for(i=0;i<n;i++)scanf("%d",&a[i]);
            sort(a,a+n,cmp);
            res=0;
            for(i=0;i<n;i++)
            {
               if(a[i]>=len)
               {
                   res++;
                   len-=a[i];
                   break;
               }
               else
               {
                   len-=a[i];
                   res++;
               } 
               }
               if(len>0)printf("impossible
    ");
               else printf("%d
    ",res);
        }
        return 0;
    }
  • 相关阅读:
    并发容器和框架之ConcurrentHashMap
    Java的LockSupport工具,Condition接口和ConditionObject
    从源码来看ReentrantLock和ReentrantReadWriteLock
    VMWARE虚拟机上Terminal中使用sudo出现”** 不在sudoers文件中,此事将被警告 “错误
    mac下idea运行项目慢问题解决
    Idea 只修改编辑区主题
    redis内部数据结构的数据结构
    mysql存储过程详解
    HashMap中resize()剖析
    谈Redis的refash的增量式扩容
  • 原文地址:https://www.cnblogs.com/Annetree/p/5510393.html
Copyright © 2011-2022 走看看