fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b) {
  14. int x = 1;
  15. a %= M;
  16. while (b) {
  17. if (b & 1) x = (x * a) % M;
  18. a = (a * a) % M;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n){
  34.  
  35. sort(begin(a), end(a));
  36. sort(begin(a), end(a), greater<int>());
  37.  
  38. int sum = 0;
  39. for(int i=0; i<n; i++){
  40. sum += (a[i] * b[i]);
  41. }
  42.  
  43. return sum;
  44. }
  45.  
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52. void solve() {
  53.  
  54. int n;
  55. cin>> n;
  56.  
  57. a.resize(n);
  58. b.resize(n);
  59. for(int i=0; i<n; i++) cin >> a[i];
  60. for(int i=0; i<n; i++) cin >> b[i];
  61.  
  62. cout << consistency(n) << endl;
  63.  
  64.  
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71. int32_t main() {
  72. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  73.  
  74. int t = 1;
  75. // cin >> t;
  76. while (t--) {
  77. solve();
  78. }
  79.  
  80. return 0;
  81. }
Success #stdin #stdout 0.01s 5288KB
stdin
6
4 9 2 1 8 4
3 6 4 7 10 1
stdout
140