题意:
分析:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define SF scanf
#define PF printf
#define MAXN 1010
using namespace std;
int dp[MAXN][MAXN][2],eat[MAXN];
int a[MAXN],n,m,maxv2,ans;
int main(){
freopen("buffet.in","r",stdin);
freopen("buffet.out","w",stdout);
SF("%d%d",&n,&m);
for(int i=1;i<=n;i++)
SF("%d",&a[i]);
eat[1]=m;
for(int i=2;i<=n;i++)
eat[i]=eat[i-1]*2/3;
for(int i=1;i<=n;i+&#