Help me in solving MOONSOONP problem

help
,
1

My issue

this code will fail on some hidden test cases.
while(t–)
{
int N,M,H;
cin>>N>>M>>H;
vector car(N);
for(int i=0;i<N;i++)
cin>>car[i];
vector outlet(M);
for(int i=0;i<M;i++)
cin>>outlet[i];
sort(car.rbegin(),car.rend());
sort(outlet.rbegin(),outlet.rend());
int total=0;
for(int i=0;i<min(N,M);i++)
{
total=total+min(car[i],outlet[i]*H);
}
cout<<total<<endl;

My code

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

int main() {
	// your code goes here
    int t;
    cin>>t;
    while(t--)
    {
        int N,M,H;
        cin>>N>>M>>H;
        vector<int> car(N);
        for(int i=0;i<N;i++)
            cin>>car[i];
        vector<int> outlet(M);
        for(int i=0;i<M;i++)
            cin>>outlet[i];
        sort(car.rbegin(),car.rend());
        sort(outlet.rbegin(),outlet.rend());
        int total=0;
        for(int i=0;i<min(N,M);i++)
        {
            total=total+min(car[i],outlet[i]*H);
        }
        cout<<total<<endl;
    }
}

Learning course: Placement preparation: Advanced
Problem Link: EVacuate to Moon in Placement preparation: Advanced