#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int n,k,w,ans,a[50];
void dfs(int t,int num,int sum){
ans=max(ans,sum);
if(num==k+1)
return;
if(sum+a[num]<=w&&t+1<=n)
dfs(t+1,num+1,sum+a[num]);
dfs(t,num+1,sum);
} //因为无法开三维数组
int main(){ //并且物品个数很少,因此用搜索
int i,sum;
while(scanf("%d%d",&n,&w)!=EOF){
sum=0;
scanf("%d",&k);
for(i=1;i<=k;i++)
scanf("%d",&a[i]);
sort(a+1,a+k+1,greater<int>()); //不加会超时
for(i=1;i<=n;i++)
sum+=a[i];
if(sum<=w){
printf("%d\n",sum);
continue;
}
ans=0;
dfs(0,1,0);
printf("%d\n",ans);
}
return 0;
}
tjut 3448
最新推荐文章于 2021-08-10 16:02:16 发布