Pagini recente » Diferente pentru preoni-2007/runda-1/solutii intre reviziile 24 si 23 | Cod sursa (job #2583940) | Istoria paginii runda/cel_mai_mare_olimpicar_2019_oni2009_zi2/clasament | Olimpiada Internationala de Informatica 2007 - jurnal de bord | Cod sursa (job #4789)
Cod sursa(job #4789)
#include <stdio.h>
int main()
{
FILE *fi, *fo;
fi=fopen("energii.in", "r");
fo=fopen("energii.out", "w");
int n;
int EG[1000], CG[1000];
int E[100000], C[100000];
int Emin, Cmin;
int i,j,q,qq;
fscanf(fi, "%d %d", &n, &Emin);
for(i=0; i<n; i++){
fscanf(fi, "%d %d", &EG[i], &CG[i]);
}
q=1;
E[0]=0; C[0]=0;
for(i=0; i<n; i++){
qq=q;
for(j=0; j<qq; j++){
E[q]=E[j]+EG[i];
C[q]=C[j]+CG[i];
q++;
}
}
Cmin=10001;
for(i=0; i<q; i++){
if(E[i]>=Emin&&C[i]<Cmin){
Cmin=C[i];
}
}
fprintf(fo, "%d\n", Cmin);
return 0;
}