C战棋小孩

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
const int N = 1000;
#define int long long
int n, m, k;
int p[N], d[N];
struct Node {
    int a, b, c, d;
    int maxv;
    bool f;
    bool operator< (const Node & q) {
        return maxv > q.maxv;
    }
}t[N];
int jud (int s) {
	int c = 0;
	while (s) {
		if (s & 1) c ++;
		s >>= 1;
	}
	return c <= k;
}
void solve() {
    cin >> n >> k>> m;
    for (int i = 1; i<= n; i ++) 
        cin >> p[i];
   
    
    for (int i = 1; i<= n; i ++) {
        cin>> t[i].a >> t[i].b >> t[i].c >> t[i].d;
        t[i].maxv = max (t[i].a, max (t[i].b, max (t[i].c , t[i].d)));
 
    }
   // sort(t + 1, t + 1 + n);
    int ans = 0;
     int tt = m;
    for (int i = 0; i < (1 << n); i ++) {
    	if (__builtin_popcount(i) != k) continue;
    	int sum = 0;
        m = tt;
        for (int j  = 1; j <= n; j ++) {
        	if ((i >> (j - 1)) & 1) {
        		d[j] = t[j].maxv;
			}
			else {
				d[j] =  max (t[j].a, t[j].b);
			}
		}
		sort(d + 1, d +1 + n, greater<int>());
        
		for (int j = 1; j<= n; j ++) {
             m += d[j];   
			if (m >= p[j]) sum ++;
        }
        ans = max (ans, sum);
    }
    cout << ans << endl;
}
signed main () {
    int t;
   t = 1;
    while (t --) solve();
}

贪心。首先礼遇确定后，算出每个的最大获益，然后从大到小进行排序。可以得到最优的效果。但是礼遇在哪儿实行是不确定的，然后观察范围，为20，通过二进制枚举，可以得到全局最大值。 证明 w1, w1 + w2, ..., w1 +,.. + wj, w1+... + wi + wj, + ,... 交换wi, wj,可以发现[1, i - 1] [j , ...]无影响，但是[i, j]减少了w[j] -w[i];