Pagini recente » Cod sursa (job #1810803) | Cod sursa (job #1151635) | Cod sursa (job #2557930) | Cod sursa (job #331616) | Cod sursa (job #440735)
Cod sursa(job #440735)
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
typedef struct mar {
int h;
int g;
} mar;
int n,ha,u;
mar a[100],v[100];
void afisare() {
int i;
printf("%d ",n);
printf("%d ",ha);
printf("%d\n",u);
for(i=0;i<n;i++)
printf("%d %d\n", v[i].h,v[i].g );
printf("\n");
}
void citire() {
int i;
FILE *f=fopen("gutui.txt","r");
fscanf(f , "%d%d%d" , &n , &ha , &u);
for(i=0;i<n;i++)
{
fscanf( f, "%d%d" , &a[i].h , &a[i].g );
a[i].h=ha-a[i].h;
}
fclose(f);
}
int compare (const void *a , const void *b) {
return ( (*(mar*)a).h - (*(mar*)b).h );
}
int gutui() {
//lung/pas
int i,j,x=0,k=0;
qsort(a,n,sizeof(mar),compare);
for(i=0;i<n;i++)
{
if(k<=a[i].h/u)
{
v[k++]=a[i];
x+=a[i].g;
}
else
{
for(j=0;j<k;j++)
if( a[i].g>v[j].g && i!=j )
{
x-=v[j].g;
v[j]=a[i];
x+=a[i].g;
break;
}
}
}
return x;
}
int main() {
int x;
citire();
x=gutui();
//printf("%d\n",x);
//afisare();
return 0;
}