2D array sort by lines

#include <stdio.h>
#include <iostream>

//#define _OTHER_VARIANT

using namespace std;

int main()
{
    int M = 10;
    int N = 8;

    int **array = new int*[M];
    for (int y = 0; y < M; ++y)
    {
        array[y] = new int[N];
        for (int x = 0; x < N; ++x)
        {
           array[y][x] = rand() % 1000 - rand() % 1000;
        }
    }
    //Сортировка всеми любимым пузырьком:
    for (int i = 0; i < M - 1; ++i)
    for (int a = 0; a < M - i - 1; ++a)
    {
        int sum_cur = 0, sum_next = 0;
        for (int x = 0; x < N; ++x)
        {
            sum_cur += array[a][x];
            sum_next+= array[a+1][x];
        }

        if (sum_cur > sum_next)
        {
#ifndef _OTHER_VARIANT
            int* buffer = array[a];
            array[a] =  array[a+1];
            array[a+1] = buffer;
#else
            for (int x = 0; x < N; ++x)
            {
                int buffer = array[a][x];
                array[a][x]   = array[a+1][x];
                array[a+1][x] = buffer;
            }
#endif
        }
    }
    //Выводим весь этот хлам:
    for (int y = 0; y < M; ++y)
    {
        int sum = 0;
        printf("%2d : |", y);
        for (int x = 0; x < N; ++x)
        {
             printf("%5d | ", array[y][x]);
             sum += array[y][x];
        }
        printf(" = %5d\n", sum);
        cout << "------";
        for (int i = 0; i < N; ++i) cout << "--------";
        cout<<"--------\n";
        delete [] array[y];
    }
    delete [] array;
    cin.get();
    return 0;
}