Repair the Wall
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3664 Accepted Submission(s): 1819
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 3 3 2 1 5 2 2 1
Sample Output
2 impossible
Author
linle
题解and题解:Kitty家的墙上有个裂缝,裂缝长为L,宽为1。Kitty得到了n块砖,宽都为1,但长度不一样,求补齐那道裂缝至少需要多少块砖。要想用量最少,肯定先用最长的砖。所以直接贪心。
注意:Kitty有锯子,可以将砖锯成他想要的长度。
<span style="font-family:SimSun;">
</span>
<span style="font-family:SimSun;">#include<cstdio>
#include<algorithm>
using namespace std;
bool cmp(__int64 a,__int64 b)
{
return a>b;
}
int main()
{
int n;
__int64 l,a[700];
while(scanf("%I64d%d",&l,&n)!=EOF)
{
for(int i=0;i<n;i++)
{
scanf("%I64d",&a[i]);
}
sort(a,a+n,cmp); //砖的长度从大到小排列
__int64 s=0;
int i,sum=0;
for( i=0;i<n;i++)
{
s=s+a[i];
sum++;
if(s==l||s>l) //如果 s>l ,即最后一块砖略长,多余的可以用锯子锯掉 ,但还是算一块砖
{
printf("%d\n",sum);
break;
}
}
if(i==n&&s<l) //即用完了所有砖还没补齐那道裂缝
{
printf("impossible\n");
}
}
return 0;
}</span>