Akash and Dinner

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    ll t;
    cin>>t;
    while(t--){
        ll n,k;
        cin>>n>>k;
        ll a[n],b[n];
        map<int,int> m,m1;
        for(int i=0;i<n;i++){
        cin>>a[i];
        m[a[i]]++;}
        for(int i=0;i<n;i++){
        cin>>b[i];}
        vector<pair<int,int>> v;
        for(int i=0;i<n;i++){
        v.push_back({b[i],a[i]});}
        sort(v.begin(),v.end());
        // for(auto i:v){
        // cout<<i.first<<" "<<i.second<<" "<<endl;}
        if(m.size()<k)
        cout<<"-1"<<endl;
        else{
            ll res=0;
            for(auto i:v){
                m1[i.second]++;
                if(k==0)
                break;
                if(m1[i.second]==1){
                res+=(i.first);
                k--;}}
                cout<<res<<endl;}
     }
    return 0;
}