fork download
  1. #include <iostream>
  2. #include <algorithm>
  3.  
  4. using namespace std;
  5.  
  6. int *generate (size_t size, size_t k) {
  7. int *T = new int[size];
  8. for (size_t i = 0; i < size; ++i)
  9. T[i] = rand() % 100;
  10.  
  11. sort(T, T + k);
  12. sort(T + k, T + size);
  13. return T;
  14. }
  15.  
  16. void print (int *T, size_t size) {
  17. for (size_t i = 0; i < size; ++i)
  18. cout << T[i] << ' ';
  19.  
  20. cout << '\n';
  21. }
  22.  
  23. void my_sort(int *T, size_t size, size_t k) {
  24. for (size_t first_head = 0, second_head = k; first_head < k; ++first_head) {
  25. if (T[first_head] > T[second_head])
  26. swap(T[first_head], T[second_head]);
  27. }
  28. }
  29.  
  30. int main () {
  31. const size_t size = 15, k = 5;
  32. int *T = generate(size, k);
  33. print(T, size);
  34. my_sort(T, size, k);
  35. print(T, size);
  36. delete [] T;
  37. return 0;
  38. }
Success #stdin #stdout 0s 3232KB
stdin
Standard input is empty
stdout
15 77 83 86 93 21 27 35 49 59 62 63 86 90 92 
15 21 77 83 86 93 27 35 49 59 62 63 86 90 92