C++ 实现插队问题：模拟排队场景，优化代码效率

#include #include

using namespace std;

int main() { int n; cin >> n; vector queue(n); for (int i = 0; i < n; i++) { cin >> queue[i]; } int x; cin >> x; queue.insert(queue.begin() + x - 1, queue[n - 1]); queue.pop_back(); for (int i = 0; i < n; i++) { cout << queue[i] << ' '; } cout << endl; return 0; }