以平均花费排序,在“哪怕’吃一点小亏’少打点Lemonade”和“就是图便宜,我直接一次买够花费更少的Lemonade”之间决策,决策方法就用递归。
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
struct costs{
double cost;
int l,orgcs;
}c[35];
int n,cs;long long le,ans=0,reans;
bool cmp(costs x,costs y){
return x.cost<y.cost;
}
long long solve(int k,long long left){
if(k==n)return 99999999;
return min(left/c[k].l*c[k].orgcs+solve(k+1,left-left/c[k].l*c[k].l),
left/c[k].l*c[k].orgcs+(left%c[k].l!=0)*c[k].orgcs);
}
int main(){
scanf("%d%d",&n,&le);
for(int i=0;i<n;i++){
scanf("%d",&cs);
c[i].cost=(double)cs/(1<<i);
c[i].l=1<<i;
c[i].orgcs=cs;
}
sort(c,c+n,cmp);
printf("%I64d",solve(0,le));
}