Pagini recente » Cod sursa (job #1418529) | Cod sursa (job #1370460) | Cod sursa (job #424440) | Cod sursa (job #795048) | Cod sursa (job #437352)
Cod sursa(job #437352)
#include <stdlib.h>
#include <stdio.h>
typedef struct{
int h;
int g;
int nivel;
}gutuie;
void Sort_Shell (gutuie v[], int dim){
int i, pas, inv;
gutuie a;
pas = dim;
while (pas >1 )
{
pas=pas/2 ;
do
{
inv=0 ;
for (i=0; i < dim-pas; i++)
{
if (v[i].g < v[i+pas].g) //sortare descresactoare a greutatilor gutuilor
{
a=v[i+pas];
v[i+pas]=v[i];
v[i]=a;
inv=1;
}
}
} while (inv);
}
}
int main(){
gutuie sir[100000];
int i;
FILE *fp=fopen("gutui.in","r");
FILE *fp1=fopen("gutui.out","w");
char s[80];
fgets(s,80,fp);
char *sep=" ";
int N=atoi(strtok (s,sep));
int H=atoi(strtok (0,sep));
int U=atoi(strtok (0,sep));
int n=0;
while ( fgets(s,80,fp) != NULL ){
sir[n].h=atoi(strtok (s,sep));
sir[n].g=atoi(strtok (0,sep));
sir[n].nivel=0;
n++;
}//end while
fclose (fp);
int g=0;
Sort_Shell(sir,N);
int a[H/U+1];
for( i=0; i<N;i++){
n=(H-sir[i].h)/U+1;
while ((a[n]==1) && (n>0))
n--;
//printf("%d ",n);
if (n!=0) {
a[n]=1;
sir[i].nivel=n;
}
}
int m=0;
while (sir[m].nivel!=0){
g=g+sir[m].g;
m++;
}
//printf("greutatea=%d \n",g);
fprintf(fp1,"%d",g);
fclose(fp1);
}