Cod sursa(job #2527401)
Utilizator | Dragutoiu Vlad-Ioan levladiator | Data | 20 ianuarie 2020 11:47:25 |
---|---|---|---|
Problema | Ghiozdan | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Lista lui wefgef | Marime | 1.14 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
int dp[75305],i,j,n,g,maxim,val,u[75305][2],cnt,fr[1000],k;
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++)
{
fin>>val;
fr[val]++;
}
for(i=200;i>=1;i--)
{
if(fr[i])
{
for(j=maxim;j>=0;j--)
{
if(dp[j]>0||j==0)
{
for(k=1;k<=fr[i]&&k*i+j<=g;k++)
{
if(dp[j+k*i]==0)
{
dp[j+k*i]=dp[j]+k;
u[j+k*i][0]=i;
u[j+k*i][1]=k;
maxim=max(maxim,k*i+j);
}
else break;
}
}
}
}
}
for(i=g;i>=1;i--)
{
if(dp[i]>0)break;
}
fout<<i<<" "<<dp[i]<<endl;
while(i>0)
{
for(j=1;j<=u[i][1];j++)
{
fout<<u[i][0]<<endl;
}
i-=u[i][1]*u[i][0];
}
}