显示代码纯文本
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=110;
int n,m,a[maxn],b[maxn],f[maxn][maxn],l,r,ans;
int main(){
#define MINE
#ifdef MINE
freopen("time.in","r",stdin);
freopen("time.out","w",stdout);
#endif
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d%d",&a[i],&b[i]);
l=1;r=m*100;//简单粗暴
while(l<=r){
ans=(l+r)>>1;
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++)
for(int j=0;j<=m;j++)
for(int k=0;k*a[i]<=ans&&k<=j;k++)//做了k个A
f[i][j]=max(f[i][j],f[i-1][j-k]+(ans-k*a[i])/b[i]);
if(f[n][m]>m)r=ans-1;
else l=ans+1;
/*for(int i=1;i<=n;i++){
for(int j=0;j<=m;j++)printf("%3d",f[i][j]);
printf("\n");
}*/
}
printf("%d",l);
return 0;
}
/*
f[i][j]表示前i个程序员做j个A之后还能做几个B
*/