#include<bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define ll long long
#define PI acos(-1)
#define INF 0x3f3f3f3f
const int N=1e6;
int c[20],n,m,x,a[20][20],ans=INF;
int main(){
ios;
cin>>n>>m>>x;
for(int i=1;i<=n;i++){
cin>>c[i];
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<(1<<n);i++){//共七种情况,即001、010、100、110、111、011、101.这是二进制表示的,十进制即1到7.
int sum=0;
int res[20];
memset(res,0,sizeof(res));
for(int j=0;j<n;j++){
if(i&(1<<j)){//判断哪一本书要买,1代表买,0代表不买
for(int k=1;k<=m;k++){
res[k]+=a[j+1][k];
}
sum+=c[j+1];
}
}
bool pan=1;
for(int j=1;j<=m;j++){
if(res[j]<x){
pan=0;
break;
}
}
if(pan) ans=min(ans,sum);
}
if(ans==INF) cout<<"-1";
else cout<<ans<<"\n";
return 0;
}
Destination
三进制枚举,暴搜
每个砝码只有三种状态:放左侧,放右侧,不取
直接三进制枚举即可,时间复杂度
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#define ll long long
#define ull unsigned long long
#define chushi(a, b) memset(a, b, sizeof(a))
const double eps = 1e-8;
const ll INF = 1e9;
const ll mod = 1e9+7;
const int maxn = 2e5+10;
using namespace std;
int a[maxn];
int main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
int FLAG = 1;
for(int i = 1; i <= n; i++) FLAG *= 3;
int res0 = 0, res1 = 0, res2 = 0;
for(int k = 1; k <= FLAG; k++){
int x = k;
int sum = 0;
for(int i = 1; i <= n; i++){
if(x % 3 == 1) sum += a[i];
if(x % 3 == 2) sum -= a[i];
x /= 3;
}
if(sum > 0) res0++;
if(sum == 0) res1++;
if(sum < 0) res2++;
}
cout << res0 << " " << res1 << " " << res2 << endl;
return 0;
}