1026번: 보물

#include<cstdio>
#include<functional>
#include<queue>
using namespace std;
int main()
{
    int n, a;
    scanf("%d", &n);
    priority_queue<int> q1;
    priority_queue<int, vector<int>, greater<int> > q2;
    for (int nn = n; nn--; q1.push(a))
        scanf("%d", &a);
    for (int nn = n; nn--; q2.push(a))
        scanf("%d", &a);
    for (a = 0; n--;q2.pop())
    {
        a += (q1.top() * q2.top());
        q1.pop();
    }
    printf("%d\n", a);
}