Unsorted array sort with selection sort

//ascending order
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int n;
    cin >> n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin >> arr[i];
    for(int i=0;i<n-1;i++)
    {
        int key=i;
        for(int j=i+1;j<n;j++)
            if(arr[j]<arr[key])
                key = j;
        swap(arr[key],arr[i]);
    }
    for(int i=0;i<n;i++)
        cout << arr[i] << " ";
    cout << endl;

    return 0;
}

//descending order
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int n;
    cin >> n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin >> arr[i];
    for(int i=0;i<n-1;i++)
    {
        int key=i;
        for(int j=i+1;j<n;j++)
            if(arr[j]>arr[key])
                key = j;
        swap(arr[key],arr[i]);
    }
    for(int i=0;i<n;i++)
        cout << arr[i] << " ";
    cout << endl;

    return 0;
}