Pagini recente » Cod sursa (job #1467286) | Cod sursa (job #448193) | Cod sursa (job #2097428) | Cod sursa (job #738193) | Cod sursa (job #3352128)
#include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
long long n,g,fr[210],dp[75010],dplast[75010];
int main()
{
fin >>n >>g;
while(n--)
{
int x;
fin >>x;
fr[x]++;
}
for(int i = 0; i <= 200; i++)
{
for(int q = 0; q <= g; q++)
{
dp[q] = INF;
dplast[q] = INF;
}
}
dp[0] = 0;
dplast[0] = 0;
for(int i = 1; i <= 200; i++)
{
for(int q = 0; q <= g; q++)
{
for(int j = 0; j <= fr[i]; j++)
{
if(q-i*j >= 0)
{
dp[q] = min(dp[q],dplast[q-i*j]+j);
}
}
}
for(int q = 0;q <= g;q++)
{
dplast[q] = dp[q];
}
if(i <= 4)
{
for(int q = 0; q <= g; q++)
{
//fout <<dp[q]<<" ";
}
//fout <<"\n";
}
}
for(int i = g; i >= 0; i--)
{
if(dp[i] != INF)
{
fout <<i<<" "<<dp[i]<<"\n";
break;
}
}
return 0;
}