Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- //#include <stdlib.h>
- //#include <time.h>
- int main() {
- int n, m, a, tmp, max1 = -10001, max2 = -10001;
- scanf("%d %d", &n, &m);
- int mas[n][m];
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- scanf("%d", &a);
- mas[i][j] = a;
- }
- }
- for (int k = 1; k < m; k++) { // Тут находится
- for (int p = 0; p < m - k; p++) { // дефолтная сортировка
- // проход по строкам в поисках максимумов
- for (int j = 0; j < n; j++) {
- if (mas[j][p] > max1)
- max1 = mas[j][p];
- if (mas[j][p + 1] > max2)
- max2 = mas[j][p + 1];
- }
- if (max1 > max2) {
- for (int t = 0; t < n; t++) {
- tmp = mas[t][p + 1];
- mas[t][p + 1] = mas[t][p];;
- mas[t][p] = tmp;
- }
- }
- max1 = 0;
- max2 = 0;
- }
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++)
- printf("%d ", mas[i][j]);
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement