代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll n,k,l;
struct gg {
    ll va,id;
}a[20],b[20],aa[20],bb[20];
int cnt=0;
ll mx=0;
bool cop(gg x,gg y){return x.va>y.va;}
int main() {
  //  freopen("sequence.in","r",stdin);
   // freopen("sequence.out","w",stdout);
    int t;scanf("%d",&t);
    for(int y=1;y<=t;y++) {
        mx=0;
        scanf("%lld%lld%lld", &n, &k, &l);
        for (int i = 1; i <= n; i++) {
            scanf("%lld", &a[i].va);
            a[i].id = i;aa[i]=a[i];
        }
        for (int i = 1; i <= n; i++) {
            scanf("%lld", &b[i].va);
            b[i].id = i;bb[i]=b[i];
        }
        sort(a + 1, a + n + 1, cop);
        sort(b + 1, b + n + 1, cop);

        for (int i = 1; i < (1ll << n); i++) {
            cnt = 0;
            for (int j = 0; j < n; j++) {
                if ((1ll << (j)) & i) {
                    cnt++;
                }
            }
            if (cnt != l)continue;
            int flag[20] = {0};
            ll tot = 0;
            for (int j = 0; j < n; j++) {
                if ((1ll << (j)) & i) {
                    flag[j + 1] = 1;
                    tot += aa[j + 1].va;
                    tot += bb[j + 1].va;
                }
            }
            int cnt1 = 0, cnt2 = 0;
            for (int j = 1; j <= n && (cnt1 != k - l || cnt2 != k - l); j++) {
                //if (flag[a[j].id])continue;
                if (cnt1 != k - l&&!flag[a[j].id])tot += a[j].va, cnt1++;
                if (cnt2 != k - l&&!flag[b[j].id])tot += b[j].va, cnt2++;
            }
            mx=max(mx,tot);
        }
        printf("%lld\n", mx);
    }
    return 0;
}

评测结果