코난도일의 자유로이~!

문제 링크 : http://algospot.cafe24.com/zbxe/?mid=aoj&action=problem&no=100

제출한 답안 :

#include <iostream>
#include <fstream>
#include <stdlib.h>

using namespace std;

#define SWAP(a,b) { int t;t=a;a=b;b=t; }

void QuickSort(int *ar, int num)
{
     int left,right;

     int key;

     if (num <= 1) return;

     key=ar[num-1];

     for (left=0,right=num-2;;left++,right--) {

          while (ar[left] < key) { left++; }

          while (ar[right] > key) { right--; }

          if (left >= right) break;

          SWAP(ar[left],ar[right]);

     }

     SWAP(ar[left],ar[num-1]);

     QuickSort(ar,left);                           // 왼쪽 구간 정렬

     QuickSort(ar+left+1,num-left-1);        // 오른쪽 구간 정렬

}

int main(void)
{
 
 int ncase, num, result = 0, i = 0, j;
 int *m, *w;

 cin >> ncase;

 while(i < ncase)
 {
  cin >> num;

  m = new int[num];
  w = new int[num];

  for(j = 0; j < num; j++)
   cin >> m[j];

  for(j = 0; j < num; j++)
   cin >> w[j];

  QuickSort(m, num);
  QuickSort(w, num);
  
  for(j = 0; j < num; j++)
   result += abs(m[j] - w[j]);

  cout << result << endl;

  result = 0;

  delete [] m;
  delete [] w;

  i++;
 }
 

 return 0;
}