fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4.  
  5. int main() {
  6.     ios::sync_with_stdio(false);
  7.     cin.tie(0);
  8.  
  9.     int n; cin >> n;
  10.     vector<ll> a(n), b(n);
  11.     for (ll &x : a) cin >> x;
  12.     for (ll &x : b) cin >> x;
  13.  
  14.     sort(a.begin(), a.end());
  15.     sort(b.begin(), b.end());
  16.  
  17.     ll sum = 0;
  18.     for (int i = 0; i < n; i++) sum += a[i] * b[i];
  19.  
  20.     cout << sum << "\n";
  21. }
  22.  
Success #stdin #stdout 0.01s 5316KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/CHz3Av
Rearrange arrays for Maximum Sum of Products
language:
C++ (gcc 8.3)
created:
19 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!