Pagini recente » Cod sursa (job #1131957) | Cod sursa (job #789903) | Cod sursa (job #2107160) | Cod sursa (job #2970508) | Cod sursa (job #642527)
Cod sursa(job #642527)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int N=5000;
const int G=10000;
struct obiect{
int g,p;
}v[N];
int n,greu;
int rez[G];
int main(){
int i,j;
in>>n>>greu;
for(i=1;i<=n;++i){
in>>v[i].g>>v[i].p;
}
for(i=1;i<=n;++i){
for(j=greu;j>=0;--j){
if(rez[j] && v[i].p+rez[j]>rez[j+v[i].g] && (j+v[i].g)<=greu ){
rez[j+v[i].g]=v[i].p+rez[j];
}
}
if(rez[v[i].g]<v[i].p){
rez[v[i].g]=v[i].p;
}
}
int maxim=0;
for(i=0;i<=greu;++i)
if(rez[i]>maxim)
maxim=rez[i];
out<<maxim;
return 0;
}