Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include "iostream"
- #include "math.h"
- using namespace std;
- int main()
- {
- setlocale(LC_ALL, "rus");
- int N, K;
- double **fitrMas, temp, max;
- cout << "Введите N и K" << endl;
- cin >> N >> K;
- if (K >= 1 && K <= N) {
- K--;
- fitrMas = new double *[N];
- for (int i = 0; i < N; i++) {
- fitrMas[i] = new double[N];
- }
- for (int i = 0; i < N; i++) // ввод матрицы
- for (int k = 0; k < N; k++) {
- cout << "Введите элемент [" << i << "] [" << k << "] = ";
- cin >> fitrMas[i][k];
- }
- for (int i = 0; i < N; i++) { // вывод матрицы
- for (int k = 0; k < N; k++) {
- cout << fitrMas[i][k] << " ";
- }
- cout << endl;
- }
- cout << "====" << endl;
- for (int i = 0; i < N - 1; i++) { // сортировка строки
- for (int k = i; k < N; k++) {
- if (fitrMas[K][i] < fitrMas[K][k]) {
- temp = fitrMas[K][i];
- fitrMas[K][i] = fitrMas[K][k];
- fitrMas[K][k] = temp;
- }
- }
- }
- for (int i = 0; i < N; i++) { // вывод матрицы
- for (int k = 0; k < N; k++) {
- cout << fitrMas[i][k] << " ";
- }
- cout << endl;
- }
- max = fabs(fitrMas[0][0]);
- for (int i = 0, k=0; i < N; i++, k++) {
- if (fabs(fitrMas[i][k]) > max) max = fabs(fitrMas[i][k]);
- }
- cout << "Максимальный по модулю " << max;
- }
- else cout << "Error";
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement