Pagini recente » Cod sursa (job #2595021) | Cod sursa (job #2305797) | Cod sursa (job #903155) | Cod sursa (job #2380182) | Cod sursa (job #1704676)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
struct rucsac{
int greutate,cost;
};
int N,G,K,prm[10001];
rucsac R[10001];
bool comp(rucsac a,rucsac b){
return a.cost>b.cost;
}
int main()
{
fi>>N>>G;
for(int i=1;i<=N;i++) fi>>R[i].greutate>>R[i].cost;
for(int i=1;i<=N;++i)
{
for(int j=G-R[i].greutate;j>=0;j--)
{
if(prm[j+R[i].greutate]<prm[j]+R[i].cost)
{
prm[j+R[i].greutate]=prm[j]+R[i].cost;
if(K<prm[j+R[i].greutate])
K=prm[j+R[i].greutate];
}
}
}
fo<<K;
}