Help me in solving CHEFDINE problem

help
,
1

My issue

last test case is failing

My code

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

int main() {
int t,d;
cin>>t;
for(d=0;d<t;d++){
    int n,k;
    cin>>n>>k;
    int a[n],b[n],c;
vector<pair<int,int>>hs;
    for(c=0;c<n;c++){
        cin>>a[c];
    }
    for(c=0;c<n;c++){
        cin>>b[c];
        hs.push_back(make_pair(b[c],a[c]));
    }
    set<int>s;
    sort(hs.begin(),hs.end());
    int t=0,i=0;
    
    while(k){
        if(i==hs.size()){break;}
        if(s.count(hs[i].second)==0){s.insert(hs[i].second);t+=hs[i].first;k--;}
        i++;
    }
    if(k==0 ){cout<<t<<endl;}
    else{cout<<-1<<endl;}
    
         }

}

Problem Link: Akash and Dinner Practice Coding Problem