[伯俊/BOJ]20300西江筋肉侠[Silver 4]

#include <stdio.h>
void QuickSort(long long arr[],int start,int end)
{
	if (start >= end)
		return;
	int piv = start, left = start + 1, right = end;
	long long temp;
	while (left <= right)
	{
		while (left <= end && arr[left] <= arr[piv])
			left++;
		while (right > start && arr[right] >= arr[piv])
			right--;
		if (left > right)
		{
			temp = arr[right];
			arr[right] = arr[piv];
			arr[piv] = temp;
		}
		else
		{
			temp = arr[left];
			arr[left] = arr[right];
			arr[right] = temp;
		}
	}
	QuickSort(arr, start, right - 1);
	QuickSort(arr, right + 1, end);
}
long long t[10000] = { 0 };
long long min = 0, M = 0;
int main()
{
	int N;
	scanf("%d", &N);
	for (int i = 0; i < N; i++)
		scanf("%lld", &t[i]);
	QuickSort(t, 0, N-1);
	if (N % 2 == 1)
	{
		for (int i = 0; i < N / 2; i++)
		{
			M = t[i] + t[(N - 2) - i];
			if (M > min)
				min = M;
		}
	}
	else
	{
		for (int i = 0; i < N / 2; i++)
		{
			M = t[i] + t[(N - 1) - i];
			if (M > min)
				min = M;
		}
	}
	printf("%lld", min);
	return 0;
}