Pagini recente » Cod sursa (job #778282) | Cod sursa (job #3189276) | Cod sursa (job #2792506) | Cod sursa (job #1429407) | Cod sursa (job #1422)
Cod sursa(job #1422)
#include<fstream.h>
ifstream in("zebughil.in");
ofstream out("zebughil.out");
int main()
{
unsigned long int n,g,i,j,a[1000],b[1000],adev,k,poz,min,poz2;
for (i=1;i<=3;i++)
{
in>>n;
in>>g;
for (j=1;j<=n;j++)
{
in>>a[j];
b[j]=0;
}
k=1;
do
{
adev=0;
for (j=1;j<=n;j++)
if (b[j]==0) {adev=1;poz=j;break;}
if (adev)
{
min=g;
for (j=poz+1;j<=n;j++)
if ((!b[j])&&(min>g-a[poz]-a[j])&&(g-a[poz]-a[j]>=0))
{
min=g-a[poz]-a[j];
poz2=j;
}
b[poz]=k;
b[poz2]=k;
k++;
}
}
while (adev);
out<<(k-1)<<endl;
}
in.close();
out.close();
}