Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll inf = LONG_LONG_MAX>>2;ll N,M,T,S,n;ll A[30];ll vis[30];ll CJ,CK;ll TJ[1010];ll TK[1010];ll r[1010];ll cul(ll st){ll JIAN=0;ll KONG=0;ll k1=T;ll k2=T;for(ll i=0;i<n;i++)if(((st>>i)&1)&&k1>=CJ) JIAN+=A[r[n-i]]*TJ[k1--];else if(((st>>i)&1)==0&&k2>=CK) KONG+=A[r[n-i]]*TK[k2--];if(KONG<S) return -inf;else return JIAN;}ll bit_cnt(ll x){ll cnt=0;while(x)