Pagini recente » Cod sursa (job #62239) | Cod sursa (job #1945498) | Cod sursa (job #2463241) | Cod sursa (job #753055) | Cod sursa (job #1246523)
#include <cstdio>
#include <algorithm>
#define INF 2000000001
using namespace std;
int a[100];
int main()
{
int T,N,G,i,p,sol,j;
freopen ("zebughil.in","r",stdin);
freopen ("zebughil.out","w",stdout);
for(T=1;T<=3;++T)
{
scanf("%d%d", &N,&G);
for(i=1;i<=N;++i)
scanf("%d", &a[i]);
sort(a+1,a+N+1);
sol=N;
for(i=N;i;--i)
{
for(p=-1,j=i-1;j;--j)
if(a[j]<=G-a[i])
{
p=j; break;
}
if(p!=-1)
{
a[i]-=a[p]; a[p]=INF; --sol;
}
else
continue;
}
printf("%d\n", sol);
}
return 0;
}