Pagini recente » Cod sursa (job #2481963) | Cod sursa (job #1866291) | Cod sursa (job #1442296) | Cod sursa (job #1864222) | Cod sursa (job #2866394)
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout("rucsac.out");
int D[10010];
int n,m,G,g,i,j,p,sol;
bitset<10010> V;
int main()
{
fin>>n>>G;
V[0]=1;
m=1;
for(i=1;i<=n;i++)
{
fin>>g>>p;
m=m+g;
if(m>G)
m=G;
for(j=m;j>=0;j--)
{
if(V[j]==1)
{
if(j+g<=G&&D[j]+p>D[j+g])
{
V[j+g]=1;
D[j+g]=D[j]+p;
sol=max(sol,D[j+g]);
}
}
}
}
fout<<sol;