Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <stdlib.h>
- #include <time.h>
- #include <algorithm>
- using namespace std;
- int main ()
- {
- srand(time(NULL));
- int n;
- cin >> n;
- if (n < 2) exit(0);
- int ***a = new int**[n];
- int *b = new int[n*n];
- for (int k = 0; k < n; k++)
- {
- *(a + k) = new int*[n];
- for (int i = 0; i < n; i++)
- {
- *(*(a + k) + i) = new int[n];
- for (int j = 0; j < n; j++)
- {
- *(*(*(a + k) + i) + j) = rand()%21 - 10;
- if (k == n - 2)
- {
- *(b + j + i*n) = *(*(*(a + k) + i) + j);
- }
- }
- }
- }
- sort(b, b + n*n);
- for (int i = 0; i < n*n; i++)
- {
- *(*(*(a + n - 2) + (i / n)) + (i % n)) = *(b + i);
- cout << setw(4) << *(b + i);
- if (i % n == n - 1) cout << endl;
- }
- delete []b;
- for (int k = 0; k < n; k++)
- {
- for (int i = 0; i < n; i++)
- delete []*(*(a + k) + i);
- delete []*(a + k);
- }
- delete []a;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement