Pagini recente » Cod sursa (job #1497697) | Cod sursa (job #1231120) | Cod sursa (job #338317) | Cod sursa (job #2396239) | Cod sursa (job #1681448)
#include<fstream>
using namespace std;
struct lapte{int x,y;};
int i,st=1,dr=1e4,n,L,a[105],b[105],dp[105][105],aux[105][105],ans;
lapte rs[105];
ifstream f("lapte.in");
ofstream g("lapte.out");
int verific(int x)
{
int i,j,k;
for(i=0;i<=n;++i)
for(j=0;j<=L;++j)
dp[i][j]=-1e9,aux[i][j]=0;
for(dp[0][0]=0,i=1;i<=n;++i)
for(j=0;j<=L;++j)
for(k=0;k<=j;++k)
if(x-a[i]*(j-k)>=0 && dp[i][j]<dp[i-1][k]+(x-a[i]*(j-k))/b[i])
dp[i][j]=dp[i-1][k]+(x-a[i]*(j-k))/b[i],aux[i][j]=k;
return dp[n][L]>=L;
}
void solutie(int x)
{
verific(ans);
for(int i=n,j=L,k=0;i;--i,j=k)
k=aux[i][j],rs[i].x=j-k,rs[i].y=dp[i][j]-dp[i-1][k];
}
int main()
{
f>>n>>L;
for(i=1;i<=n;++i)
f>>a[i]>>b[i];
while(st<=dr)
{
int pivot=(st+dr)/2;
if(verific(pivot)) ans=pivot,dr=pivot-1;
else st=pivot+1;
}
g<<ans<<"\n";
solutie(ans);
for(i=1;i<=n;++i) g<<rs[i].x<<" "<<rs[i].y<<"\n";
f.close();
g.close();
return 0;
}