Pagini recente » Cod sursa (job #1108267) | Cod sursa (job #169163) | Cod sursa (job #526217) | Cod sursa (job #94179) | Cod sursa (job #1028541)
#include <fstream>
using namespace std;
long d[1002], p[1003], g[1002];
long maxi(long a, long b){
if(a<b)return b;
else return a;
}
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
long n,G,mx;
in>>n>>G;
for(int i=1; i<=n; i++){
in>>g[i];
in>>p[i];
}
d[0]=0;
for(int i=1; i<=n; i++){
mx=0;
for(int j=G; j>=g[i]; j--){
d[i]=maxi(d[ i-g[i] ]+p[j], mx);
}
}
out<<d[n];
in.close();
out.close();
return 0;
}