fork download
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. using namespace std;
  5.  
  6. void print1(const vector<int> &a) {
  7. for (int i = 0; i < a.size(); i++) {
  8. cout << a[i] << " ";
  9. }
  10. cout << endl;
  11. }
  12.  
  13. void sort_ins(vector<int> &a) {
  14. for (int i = 1; i < a.size(); i++) {
  15. int c = a[i];
  16. int k = i;
  17.  
  18. while (k > 0 && a[k-1] > c) {
  19. a[k] = a[k-1];
  20. k--;
  21. }
  22. a[k] = c;
  23. }
  24. }
  25.  
  26. void print2(const vector<vector<int> > &a) {
  27. for (int i = 0; i < a.size(); i++) {
  28. for (int j = 0; j < a[i].size(); j++) {
  29. cout << a[i][j] << " ";
  30. }
  31. cout << endl;
  32. }
  33. }
  34.  
  35. int main() {
  36. int m, n;
  37. cin >> m >> n;
  38.  
  39. vector<vector<int> > a (m, vector<int> (n, 0));
  40. for (int i = 0; i < a.size(); i++) {
  41. for (int j = 0; j < a[i].size(); j++) {
  42. cin >> a[i][j];
  43. }
  44. }
  45.  
  46. print2(a);
  47.  
  48. cout << endl;
  49.  
  50. ///sort_ins(a[0]);
  51.  
  52. ///print1(a[0]);
  53.  
  54. for (int i = 0; i < a.size(); i++) {
  55. sort_ins (a[i]);
  56.  
  57. }
  58.  
  59. print2(a);
  60.  
  61. return 0;
  62. }
Success #stdin #stdout 0.01s 5288KB
stdin
4 6 
8 3 14 25 -2 4
0 2 6 4 99 10
7 8 9 51 37 14
-9 15 -20 50 22 0
stdout
8 3 14 25 -2 4 
0 2 6 4 99 10 
7 8 9 51 37 14 
-9 15 -20 50 22 0 

-2 3 4 8 14 25 
0 2 4 6 10 99 
7 8 9 14 37 51 
-20 -9 0 15 22 50