Cod sursa(job #1002116)
Utilizator | Data | 26 septembrie 2013 21:42:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int i,n,j,w,s,a[10000],b[10000],g,Max;
int main()
{f>>n>>g;
for(i=1;i<=n;i++)f>>a[i]>>b[i];
for(i=1;i<=n;i++){
w=0;
s=0;
if(w+a[i]<g){s=s+b[i];
w=w+a[i];
}
for(j=1;j<=n-(n-i+2);j++){
if(w+a[i]<g){
s=s+b[i];
w=w+a[i];
}
}
if(s>Max)Max=s;
}
h<<Max+2;
return 0;
}