[백준] 보물 - 복습

https://www.acmicpc.net/problem/1026

간단한 정렬 문제

#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

int A[51];
int B[51];

int main()
{
    int N;
    cin >> N;

    for (int i = 0; i < N; i++)
        cin >> A[i];

    for (int i = 0; i < N; i++)
        cin >> B[i];

    sort(A, A + N);
    sort(B, B + N, greater<int>());

    int sum = 0;
    for (int i = 0; i < N; i++)
    {
        sum += A[i] * B[i];
    }
    cout << sum << endl;
}