题解

#include <iostream>
using namespace std;

int a[201], x[201], y[201]; // 好习惯：全局数组
int main() {
    int n, m;
    cin>>n>>m;
    for (int i = 0; i < n; i++) cin>>a[i];

    for (int i = 0; i < m; i++) cin>>x[i]>>y[i];

    
    for (int i = 0; i < m; i++)
    {
        int j;
        for (j = 0; j < n; j++)
        {
            if (a[j] == x[i])
            {
                break;
            }
        }
        if (j < n)
        {
            for (int k = n - 1; k > j; k--)
            {
                a[k + 1] = a[k];
            }
            a[j + 1] = y[i];
        }
        else
        {
            a[n] = y[i];
        }
        n++;
    }
    
    for (int i = n - 1; i >= 0; i--) cout<<a[i]<<' ';
    
    return 0;
}