Pagini recente » Cod sursa (job #1170542) | Cod sursa (job #327717) | Cod sursa (job #2184083) | Cod sursa (job #2236060) | Cod sursa (job #1704737)
#include<fstream>
using namespace std;
fstream f("rucsac.in");
ofstream t("rucsac.out");
struct RUC{
int GR, profit;
};
int N, G, S, A[10001];
RUC Q[10001];
int main(){
f>>N>>G;
for(int i=1;i<=N;++i)
f>>Q[i].GR>>Q[i].profit;
for(int i=1;i<=N;++i){
for(int j = G-Q[i].GR; j>=0; j--){
if(A[j+Q[i].GR] < A[j] + Q[i].profit){
A[j+Q[i].GR] = A[j] + Q[i].profit;
if(S < A[j+Q[i].GR])
S = A[j+Q[i].GR];
}
}
}
/*FOR(i,1,N)
for( int j = G - W[i]; j >= 0; --j) {
if( Q[j+W[i]] < Q[j] + P[i] )
{
Q[j+W[i]] = Q[j] + P[i];
if( Q[j+W[i]] > S)
S = Q[j+W[i]];
}ROR(j,G-Q[i].GR,0)
for(int j = G-Q[i].GR; j>=0; --j)
}*/
t<<S;
}