题解 | 小苯的01背包（easy）

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

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n), w(n);
    for (int i = 0; i < n; ++i) cin >> v[i] >> w[i];
    int ans = 0;
    for (int i = 11; i > -1; --i){
        int mask = ans | (1 << i);
        int vol = -1;
        for (int i = 0; i < n; ++i){
            if ((mask & w[i]) == mask)    vol &= v[i];
        }
        if (vol != -1 && vol <= k) ans = mask; 
    }
    cout << ans;
}