Pagini recente » Istoria paginii runda/concurs_test/clasament | Istoria paginii runda/sg435346t/clasament | Istoria paginii runda/kingovdeception/clasament | Atasamentele paginii winners23 | Cod sursa (job #441791)
Cod sursa(job #441791)
#include <stdlib.h>
#include <stdio.h>
typedef struct {
int h;
int g;
}gutui;
int compareG(const void *a, const void *b)
{
gutui *aa = (gutui *)a;
gutui *bb = (gutui *)b;
return (bb->g -aa->g);
}
int retrieve(int test[],int index)
{
if(test[index]==0)
{
test[index]=1;
return 1;
}
else
for(index;index>0;index--)
if(test[index]==0)
{
test[index]=1;
return 1;
}
return 0;
}
int main()
{
FILE *fis=fopen("gutui.in","r");
FILE *fis_out=fopen("gutui.out","w");
int n,h_max,u,i,max=0,greutate=0,ok=0;
fscanf(fis,"%i",&n);
gutui a[n];
fscanf(fis,"%i",&h_max);
fscanf(fis,"%i",&u);
for(i = 0; i < n; i++)
fscanf(fis, "%i %i", &a[i].h,&a[i].g);
qsort(a,n,sizeof(gutui),compareG); //gutui sortate descrescator dupa greutate
for(i=0;i<n;i++)
{ a[i].h=1+(h_max-a[i].h)/u;
if (a[i].h>max)
max=a[i].h;
}
//max=nr maxim de gutui care pot fi luate
int test[max+1];
for(i=0;i<=max;i++)
test[i]=0;
for(i=0;i<n;i++)
if(retrieve(test,a[i].h)==1)
{ greutate+=a[i].g;
printf("Am pus greutatea :%i\n",a[i].g); }
printf("Greutate max: %i",greutate);
fprintf(fis_out,"%i",greutate);
//getch();
return 0;
}