Advertisement
Ver0n1ka

Untitled

Dec 21st, 2019
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.92 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main()
  5. {
  6. int k, p, s1, s2, minimum = INT_MAX, maximum = INT_MIN;
  7. int a[100][100];
  8. int min;
  9. int max;
  10. cin >> k >> p;
  11. if (k <= 0 || p <= 0)
  12. {
  13. cout << "Empty matrix or range check error" << endl;
  14. return 0;
  15. }
  16. for (int i = 0; i < k; i++)
  17. {
  18. for (int j = 0; j < p; j++)
  19. {
  20. cin >> a[i][j];
  21. if (a[i][j] > maximum)
  22. {
  23. max = a[i][j];
  24. maximum = a[i][j];
  25. s1 = i;
  26. }
  27.  
  28. if (a[i][j] < minimum)
  29. {
  30. min = a[i][j];
  31. minimum = a[i][j];
  32. s2 = i;
  33. }
  34. }
  35. }
  36. if (s1 == s2)
  37. {
  38. for (int i = 0; i < k; i++)
  39. {
  40. for (int j = 0; j < p; j++)
  41. {
  42. cout << a[i][j] << " ";
  43. }
  44. cout << endl;
  45. }
  46. return 0;
  47. }
  48.  
  49. for (int j = 0; j < p; j++)
  50. swap(a[s1][j], a[s2][j]);
  51.  
  52. for (int i = 0; i < k; i++)
  53. {
  54. for (int j = 0; j < p; j++)
  55. {
  56. cout << a[i][j] << " ";
  57. }
  58. cout << endl;
  59. }
  60.  
  61. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement