蓝桥杯 最小乘积

#include <iostream>
#include <algorithm>
using namespace std;

bool cmp(int p,int q)
{
return p>q;
}

int T,i,n,a[100],b[100],ans;

int main()
{
cin >> T;
while (T--)
{
ans=0;
cin >> n;
for (i=0;i<n;i++)
cin >> a[i];
for (i=0;i<n;i++)
cin >> b[i];
sort(a,a+n);
sort(b,b+n,cmp);
for (i=0;i<n;i++)
ans+=a[i]*b[i];
cout << ans << endl;
}
return 0;
}