Finding biggest sum between two equally long arrays

#include <iostream>

using namespace std;

int main()
{
    int arr_one[4] = {4, 8, 1, 3};
    int arr_two[4] = {9, 0, 3, 1};
    int arr_sum[4 + 4 + 4 + 4];
    int loops = 0;

    for (int y = 0; y < 4; y++)
    {
        for (int x = 0; x < 4; x++)
        {
            arr_sum[loops] = arr_one[y] + arr_two[x];
            loops++;
        }
    }
    //int pause; cin >> pause;

    //Gnome sort the arr_sum array!

    int p = 0;
    int temp;

    while (p < 16)
    {
        if (p == 0 || arr_sum[p] >= arr_sum[p - 1])
        {
            p++;
        }
        else
        {
            temp = arr_sum[p - 1];
            arr_sum[p - 1] = arr_sum[p];
            arr_sum[p] = temp;
            p--;
        }
    }

    cout << arr_sum[14];

    int pp;
    cin >> pp;
}