Pagini recente » Cod sursa (job #218462) | Cod sursa (job #2436226) | Cod sursa (job #529168) | Cod sursa (job #2445734) | Cod sursa (job #2952500)
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int n,G, d[10001];
int main() {
cin>>n>>G;
for(int i=1;i<=n;i++) {
d[i]=-1;
}
for(int i=1;i<=n;i++) {
int g,p;
cin>>g>>p;
for(int j=G-g;j>=0;j--) {
if(d[j]!=-1) {
if(d[j]+p>d[j+g]) {
d[j+g]=d[j]+p;
}
}
}
}
int n3=-2;
for(int j=1;j<=G;j++) {
n3=max(n3,d[j]);
}
cout<<n3;
return 0;
}