백준 1026

#include <iostream>
#include <algorithm>

using namespace std;

int num;

int A[50];
int B[50];
bool check[50] = { false, };

int maxi = 0;
int sum = 0;

int find() {

	maxi = 0;

	for (int i = 0; i < num; i++) {

		if (B[i] >= maxi && check[i] != true) { maxi = B[i]; }

	}

	for (int i = 0; i < num; i++) {

		if (B[i] == maxi&& check[i]==false) {
			check[i] = true;

			break;
		}


	}

	return maxi;

}


int main() {


	cin.tie(0);
	ios_base::sync_with_stdio(false);

	cin >> num;


	for (int i = 0; i < num; i++) {
		cin >> A[i];
	}

	for (int i = 0; i < num; i++) {
		cin >> B[i];
	}
	sort(A, A + num);




	for (int i = 0; i < num; i++) {
		sum += (A[i] * find());
	}

	cout << sum;
}