代码：

#include <iostream>
using namespace std;

void optimise ();
void queue_insert (int value, int queue[], int &end);
void queue_sort (int &count, int queue[], int end);

int main () {
    int cnt = 0, end = 0, m, n, x, height[2009], queue[2009];
    optimise();

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> height[i];

    for (cin >> m; m--; cnt = 0) {
        cin >> x;
        queue_insert(height[x], queue, end);
        queue_sort(cnt, queue, end);
        cout << cnt << '\n';
    }

    return 0;
}

void optimise () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

void queue_insert (int value, int queue[], int &end) {
    queue[end++] = value;
}

void queue_sort (int &count, int queue[], int end) {
    while (end > 0 and queue[end - 1] > queue[end]) {
        swap(queue[end - 1], queue[end]);
        end--;
        count++;
    }
}

大佬救救我 555