C++ 编程实现：体育课换位置 - 找出最高和最矮的同学并交换位置

#include "iostream"\n#include "vector"\n#include "algorithm"\n\nint main() {\n int n;\n std::cin >> n;\n \n std::vector heights(n);\n for (int i = 0; i < n; i++) {\n std::cin >> heights[i];\n }\n \n int minIndex = std::min_element(heights.begin(), heights.end()) - heights.begin();\n int maxIndex = std::max_element(heights.begin(), heights.end()) - heights.begin();\n \n std::swap(heights[minIndex], heights[maxIndex]);\n \n for (int i = 0; i < n; i++) {\n std::cout << heights[i] << " ";\n }\n \n return 0;\n}