Pagini recente » Borderou de evaluare (job #1465911) | Borderou de evaluare (job #2576073) | Borderou de evaluare (job #1639639) | Borderou de evaluare (job #1702016) | Cod sursa (job #1392886)
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int n,l,i,j,k,t;
int cost[101][101],d[101][101],a[101],b[101];
int main(void){
fin>>n>>l;
for(i=1;i<=n;i++)
fin>>a[i]>>b[i];
t=0;
while(d[n][l]<=l,t++)
{
for(i=0;i<=n;i++)
for(j=2;j<l;j++)
d[i][j]=-INF;
d[0][0]=0;
for(i=1;i<=n;i++)
for(j=0;j<=l;j++)
for(k=0;k*a[i]<=t;k++)
if(d[i][j]<d[i-1][j-k]+(t-k*a[i])/b[i])
{
cost[i][j]=k;
d[i][j]=d[i-1][j-k]+(t-k*a[i])/b[i];
}
}
fout<<t<<"\n";
while(n){
fout<<cost[n][l]<<" "<<(t-cost[n][l]*a[n])/b[n]<<"\n";
l-=cost[n][l];
n--;
}
return 0;
}