백준 1026번 : 보물

문제 링크

 

C++14

#include <bits/stdc++.h>
using namespace std;

int n,t;

void S(vector<int> x,vector<int> y){
  int sum =0;
  for(int i=0; i<n; i++){
    sum = sum + x[i]*y[i];
  }
  cout << sum;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >>n;
    vector<int> a;
    vector<int> b;

    for(int i=0; i<n; i++){
      cin >> t;
      a.push_back(t);
    }
    for(int i=0; i<n; i++){
      cin >> t;
      b.push_back(t);
    }
sort(a.begin(), a.end()); 
sort(b.begin(), b.end(), greater<>());  
S(a,b);

}