наибольшее интервью

#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

void second_sort (int *arr, int n)
{
    for(int j = n-1; j >= 0; --j)
        for(int i = 0; i < j; ++i)
            if (arr[i+1]+arr[i] > arr[i]+arr[i+1])
                swap(arr[i], arr[i+1]);
}

void first_sort (int *arr, int n)
{
    for (int i=1; i<n; ++i)
      for (int j=0; j<n-i; j++)
        if (arr[j] < arr[j+1])
         swap (arr[j], arr[j+1]);
}
int main()
{
  int n = 0, index = 0;
  cin >> n;

 int  *arr = new int[n];

  for (int i = 0; i<n; i++)
  cin >> arr[i];

second_sort(arr, n);
first_sort(arr, n);

for (int i = 0; i<n; i++)
    cout << arr[i];
}