题解

#include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<long long> arr(n);
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }

    int idx = 0;
    // 先存非零元素
    for (int i = 0; i < n; ++i) {
        if (arr[i] != 0) {
            arr[idx++] = arr[i];
        }
    }
    // 剩余位置补零
    while (idx < n) {
        arr[idx++] = 0;
    }

    // 输出结果
    for (int i = 0; i < n; ++i) {
        if (i > 0) cout << " ";
        cout << arr[i];
    }
    cout << endl;

    return 0;
}