Pagini recente » Cod sursa (job #3031414) | Cod sursa (job #1424109) | Diferente pentru runda/viata_periculoasa_pe_infoarena intre reviziile 8 si 9 | Istoria paginii runda/matrice/clasament | Cod sursa (job #441824)
Cod sursa(job #441824)
#include <stdlib.h>
#include <stdio.h>
int h[10000], g[10000], rm[10000], x[10000];
int i, j, H, U, k, aux;
long int n, sum=0;
int main()
{
FILE* fin;
FILE* fout;
fin = fopen ("gutui.in", "r");
fout = fopen ("gutui.out", "w");
fscanf (fin, "%li %d %d", &n, &H, &U);
for ( i=0; i<n; i++)
fscanf ( fin, "%d %d", &h[i], &g[i] );
for( i=0; i<n;i++)
for ( j=i+1; j<n;j++)
if( g[i] < g[j] )
{
aux = h[i];
h[i] = h[j];
h[j] = aux;
aux = g[i];
g[i] = g[j];
g[j] = aux;
}
/*
for( i=0; i<n; i++)
printf("%d ", g[i]);
for( i=0; i<n; i++)
printf("%d ", h[i]);
*/
for( i=0; i<n; i++)
rm[i] = (H-h[i]) / U ;
int max=rm[0];
for( i=1; i<n; i++)
if(max < rm [i])
max = rm[i];
for( i=0; i<=max; i++)
x[i] = 0;
for( i=0; i<n; i++)
if( h[i] <= H )
{
if( x[ rm[i] ]==0 )
{
x[ rm[i] ] = g[i];
//printf("- %d -", x[(H-h[i]) / U]);
}
else if( x[ rm[i] ]!=0 )
for ( k= rm[i] -1 ; k>=0; k--)
if( x[k]==0 )
{
x[ k ] = g[i];
//printf("%d ", x[k]);
break;
}
}
/*
for( i=0; i<=max; i++)
printf("%d ", x[i]);
*/
for( i=0; i<=max; i++)
sum = sum + x[i];
fprintf(fout, "%li", sum);
fclose(fin);
fclose(fout);
return 0;
}