2022-12 何以包邮dfs

#include
using namespace std;
const int maxn = 31;
int n , x, minsum;
int dp[maxn];
void dfs(int index,int dp[],int sum){
if(index == n){
if(sum < minsum && sum >= x){
minsum = sum;
}
return;
}
dfs(index +1,dp,sum);
dfs(index + 1,dp,sum+dp[index]);
}
int main(){
cin>>n>>x;
minsum = 1000010 ;
for(int i=0;i<n;i++){
cin>>dp[i];
}
dfs(-1,dp,0);
cout<<minsum;
return 0;
}