Cod sursa(job #435300)

Utilizator Cristea_AdrianCristea Adrian Cristea_Adrian Data 7 aprilie 2010 11:37:41
Problema Gutui Scor 20
Compilator c Status done
Runda teme_upb Marime 2.53 kb
#include <stdio.h>
#include <stdlib.h>

typedef struct {
        int nivel;
        int masa;
        } Gutui;


int compare(const void *c, const void *d)
{
     const Gutui *a = (const Gutui *)c;
     const Gutui *b = (const Gutui *)d;
     
     if(a->nivel!=b->nivel)
                         return (b->nivel - a->nivel);
     return(b->masa - a->masa);
}

int compare2 (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}



int main() {
    int h_max, nr_gutui, d_h;
    int i, j, min, pus=0, nr_niv;
    int *puse;
    Gutui *gut;
    int strans=0, niv_max;
    
    FILE *in, *out;

    in=fopen("gutui.in","r");
    out=fopen("gutui.out","w");
    
    fscanf(in,"%d ", &nr_gutui);
    fscanf(in,"%d ", &h_max);
    fscanf(in,"%d", &d_h);
    
    //printf("%d\n\n",nr_gutui);

    puse=(int *)malloc(1*sizeof(int));
    
    gut=(Gutui *)malloc(nr_gutui*sizeof(Gutui));
    
    for(i=0;i<nr_gutui;i++) {
         fscanf(in,"\n%d %d",&j, &gut[i].masa);
         gut[i].nivel=(j-1)/d_h+1;
         //printf("%d %d\n",gut[i].nivel,gut[i].masa);
         }
    
    qsort(gut, nr_gutui, sizeof(Gutui), compare);

    
    //mergeSort(h,masa,temp1,prioritate,0,nr_gutui-1);
    
    min=gut[nr_gutui-1].nivel;
    nr_niv=(h_max-min)/d_h+1;
                           
    niv_max=h_max/d_h;
    
    for(i=0;i<nr_gutui;i++) {
         if(gut[i].nivel+pus-niv_max==1)
              if(gut[i].masa>puse[0]) {
                                      puse[0]=gut[i].masa; 
                                      qsort(puse,pus,sizeof(int),compare2);
                                      }
         if(gut[i].nivel+pus<=niv_max) {
                                      pus++;
                                      puse=(int*)realloc(puse, pus * sizeof(int));     
                                      puse[pus-1]=gut[i].masa;
                                      qsort(puse,pus,sizeof(int),compare2);
                                      }
                            
                            }
         
    //printf("\n");
    //for(i=0;i<nr_gutui;i++)
         //printf("%d %d\n",(gut[i]).nivel, (gut[i]).masa);
    
    for(i=0;i<pus;i++) {
                       //printf("%d ",puse[i]);
                       strans+=puse[i];
                       }
    
    //printf("\nmin=%d \nnivele=%d\nstrans=%d\n",min,nr_niv, strans);
    
    fprintf(out,"%d",strans);

    fclose(in);
    fclose(out);
        
        //system("pause");
           
    return 0;
}