#include <bits/stdc++.h>
using namespace std;
 
long long minimizeSumofProduct(vector<int> a, vector<int> b){
	int n = a.size();
	sort(a.begin(), a.end());
	sort(b.begin(), b.end(), greater<int>());
 
	long long sum = 0;
	for(int i = 0; i < n; i++){
		sum += a[i]*b[i]*1ll;
	}
 
	return sum;
}
 
int main() {
	// your code goes here
	vector<int> a = {1, 8, 5};
	vector<int> b = {-1, 0, 80};
 
	cout << minimizeSumofProduct(a, b);
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpsb25nIGxvbmcgbWluaW1pemVTdW1vZlByb2R1Y3QodmVjdG9yPGludD4gYSwgdmVjdG9yPGludD4gYil7CglpbnQgbiA9IGEuc2l6ZSgpOwoJc29ydChhLmJlZ2luKCksIGEuZW5kKCkpOwoJc29ydChiLmJlZ2luKCksIGIuZW5kKCksIGdyZWF0ZXI8aW50PigpKTsKCQoJbG9uZyBsb25nIHN1bSA9IDA7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQlzdW0gKz0gYVtpXSpiW2ldKjFsbDsKCX0KCQoJcmV0dXJuIHN1bTsKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgl2ZWN0b3I8aW50PiBhID0gezEsIDgsIDV9OwoJdmVjdG9yPGludD4gYiA9IHstMSwgMCwgODB9OwoJCgljb3V0IDw8IG1pbmltaXplU3Vtb2ZQcm9kdWN0KGEsIGIpOwoJCglyZXR1cm4gMDsKfQ==