백준(BOJ) 1026 보물섬 **

정말 단순 정렬 구현 문제이다.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <math.h>
#include <queue>
#include <set>
#include <list>
#include <utility>
#include <functional>
#define MAX 1005
#define INF 987654321
#define MOD 1000000
#pragma warning(disable:4996)
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;

vector<int> qa, qb;
int n,m,arr[105];

int main()
{
	scanf("%d", &n);
	for (int i = 0;i < n; i++)
	{
		scanf("%d", &m);
		qa.push_back(m);
	}
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &m);
		qb.push_back(m);
	}
	sort(qa.begin(), qa.end());
	sort(qb.begin(), qb.end(),greater<int>());

	int ans = 0;
	for (int i = 0; i < n; i++)
		ans += qa[i] * qb[i];
	printf("%d", ans);
	return 0;
}