Help me in solving MOONSOON problem

help
,
1

My issue

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;
	    vector<int> cap(n);
	    for(int i=0;i<n;i++){
	        cin>>cap[i];
	    }
	    vector<int> power(m);
	    for(int i=0;i<m;i++){
	        cin>>power[i];
	    }
	    sort(cap.begin(),cap.end());
	    sort(power.begin(),power.end());
	    
	    reverse(cap.begin(),cap.end());
	    reverse(power.begin(),power.end());
	    
	    int ans=0;
	   
	    for(int i=0;i<n;i++){
	        
	            int store = power[i]*h;
	            if(store>cap[i]){
	                ans+=cap[i];
	              //  n--;
	               // m--;
	            }else{
	                ans+=store;
	               // n--;
	               // m--;
	            }
	    }
	    
	    cout<<ans<<endl;
	    
	}
	return 0;
}

Problem Link: MOONSOON Problem - CodeChef