Pagini recente » Cod sursa (job #1914777) | Cod sursa (job #1689436) | Cod sursa (job #968173) | Cod sursa (job #1836523) | Cod sursa (job #2411360)
#include <fstream>
using namespace std;
int v[10001];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main() {
int n, g, w, p, i, j, max;
fin>>n>>g;
for(i=1;i<=n;i++) {
fin>>w>>p;
for(j=g;j>=w;j--) {
if(v[j-w]!=0 && v[j-w]+p>v[j]) {
v[j]=v[j-w]+p;
}
}
if(v[w]<p) {
v[w]=p;
}
}
max=0;
for(i=1;i<=g;i++) {
if(v[i]>max) {
max=v[i];
}
}
fout<<max;
return 0;
}