Pagini recente » Cod sursa (job #1235632) | Cod sursa (job #1289167) | Cod sursa (job #2854868) | Cod sursa (job #1826051) | Cod sursa (job #3210428)
#include <fstream>
using namespace std;
ifstream fin ("lapte.in");
ofstream fout ("lapte.out");
int dp[101][101],st,dr,mij,n,m,i,j,x[101],y[101];
struct stare
{
int x,y;
};
stare t[101][101];
bool f (int val)
{
for (int i=0; i<=n; i++)
{
for (int a=0; a<=m; a++)
dp[i][a]=-100000;
}
///dp[i][a][b]->dp[i][a]=max (dp[i][a][...])
dp[0][0]=0;
for (int i=1; i<=n; i++)
{
for (int a=0; a<=m; a++)
{
for (int xl=0; xl<=a&&xl*x[i]<=val; xl++)
{
int yl=min (m,(val-xl*x[i])/y[i]);
if (dp[i-1][a-xl]+yl>dp[i][a])
{
dp[i][a]=dp[i-1][a-xl]+yl;
t[i][a]={xl,yl};
}
}
}
}
return dp[n][m]>=m;
}
void rec (int i,int a)
{
if (i==0)
return ;
rec (i-1,a-t[i][a].x);
fout<<t[i][a].x<<" "<<t[i][a].y<<"\n";
}
int main()
{
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>x[i]>>y[i];
st=1;
dr=10001;
while (st<=dr)
{
mij=(st+dr)/2;
if (f (mij))
dr=mij-1;
else
st=mij+1;
}
fout<<st<<"\n";
f (st);
rec (n,m);
return 0;
}