최솟값 만들기-Lv2

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

int solution(vector<int> A, vector<int> B)
{
    int answer = 0;
    
    //vector<int>::const_iterator citr;
    
    sort(A.begin(), A.end(), greater<int>());//A는 내림차순 정렬
    sort(B.begin(), B.end(), less<int>());//B는 오름차순 정렬
    for(int i = 0; i<A.size(); i++)
    {
        answer += A[i]*B[i];
    }
    return answer;
}