Advertisement
OMEGAHEAD_MonkoX

Untitled

Jan 16th, 2020
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.27 KB | None | 0 0
  1. #include <iostream>
  2. #include <iomanip>
  3. #include <string>
  4. #include <sstream>
  5. #include <algorithm>
  6. #include <vector>
  7. #include <stdlib.h>
  8. #include <stdio.h>
  9. #include <fstream>
  10. #include <stack>
  11. #include <map>
  12. #include <cstring>
  13. #include <cmath>
  14. #include <set>
  15. #include <iterator>
  16. #include <cmath>
  17. #include <locale>
  18.  
  19. using namespace std;
  20.  
  21. bool cols(const vector<long long> &col1, const vector<long long> &col2)
  22. {
  23. long long n1 = 0, n2 = 0;
  24. for(int i = 0; i < col1.size(); i++)
  25. {
  26. if(abs(col1[i]) % 10 == 3)
  27. n1++;
  28. if(abs(col2[i]) % 10 == 3)
  29. n2++;
  30. }
  31. return n1 <= n2;
  32. }
  33.  
  34. bool col(long long num1, long long num2)
  35. {
  36. if(abs(num1) == abs(num2))
  37. return num2 <= num1;
  38. return abs(num2) < abs(num1);
  39. }
  40.  
  41. int main()
  42. {
  43. int n, m;
  44. cin >> n >> m;
  45. vector<vector<long long> > mtrx(m, vector<long long>(n));
  46. for(int i = 0; i < n; i++)
  47. for(int j = 0; j < m; j++)
  48. cin >> mtrx[j][i];
  49. sort(mtrx.begin(), mtrx.end(), cols);
  50. for(int j = 0; j < m; j++)
  51. sort(mtrx[j].begin(), mtrx[j].end(), col);
  52. for(int i = 0; i < n; i++)
  53. {
  54. for(int j = 0; j < m; j++)
  55. cout << mtrx[j][i] << " ";
  56. cout << endl;
  57. }
  58. return 0;
  59. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement