Pagini recente » Cod sursa (job #2706690) | Cod sursa (job #1749681) | Cod sursa (job #1258174) | Cod sursa (job #574749) | Cod sursa (job #2244927)
#include <fstream>
using namespace std;
int n,G,v[5001],p[5001],i,j,ma,rasp[10001];
int main(int argc, char *argv[]) {
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>G;
for(i=1; i<=n; i++) {
f>>v[i]>>p[i];
}
for(i=1;i<=n;i++) {
for(j=G-v[i];j>=0;j--) {
if(rasp[j]+p[i]>rasp[j+v[i]]) {
rasp[j+v[i]]=rasp[j]+p[i];
ma=max(ma,rasp[j+v[i]]);
}
}
}
g<<ma;
f.close();
g.close();
}