[백준 1026] 보물

www.acmicpc.net/problem/1026

1026번: 보물

#include <stdio.h>
#include <algorithm>

using namespace std;
int n;
int a[50];
int b[50];
int main(void)
{
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
  {
    scanf("%d", &a[i]);
  }

  sort(a, a + n);

  for (int i = 0; i < n; i++)
  {
    scanf("%d", &b[i]);
  }

  int max = -1, idx = -1;
  int sum = 0;
  for (int i = 0; i < n; i++)
  {
    max = -1, idx = -1;
    for (int j = 0; j < n; j++)
    {
      if (max < b[j])
      {
        max = b[j];
        idx = j;
      }
    }
    sum += a[i] * max;
    b[idx] = -1;
  }

  printf("%d\n", sum);
  return 0;
}