Advertisement
Guest User

Untitled

a guest
Jan 22nd, 2019
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. #include <fstream>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. ifstream fin("halfsort2.in");
  8. ofstream fout("halfsort2.out");
  9.  
  10. int n;
  11. fin>>n;
  12. int vec[n + 1];
  13. for (int i = 1; i <= n; i++)
  14. fin>>vec[i];
  15.  
  16. int aux;
  17. for (int i = 1; i < n - 1; i += 2)
  18. for (int j = i + 2; j < n; j += 2)
  19. if (vec[i] < vec[j])
  20. {
  21. aux = vec[i];
  22. vec[i] = vec[j];
  23. vec[j] = aux;
  24. }
  25.  
  26. for (int i = 2; i < n; i += 2)
  27. for (int j = i + 2; j <= n; j += 2)
  28. if (vec[i] > vec[j])
  29. {
  30. aux = vec[i];
  31. vec[i] = vec[j];
  32. vec[j] = aux;
  33. }
  34.  
  35. for (int i = 1; i <= n; i++)
  36. fout<<vec[i]<<' ';
  37.  
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement