6
  • 板块灌水区
  • 楼主GHW771201123456
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/3/31 15:09
  • 上次更新2024/3/31 16:36:34
查看原帖
6
1075460
GHW771201123456楼主2024/3/31 15:09
#include <iostream>
using namespace std;
int w[10000005];
int main() {
	long long n, m, k,l;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> k;
		for (int j = 1; j <= n; j++) {
			if (w[j] == k) {
				l = j;
				break;
			}
		}
		w[n+1]=w[l];
		for (int i = l; i <= n; i++) {
			w[i] =w[i+1];
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << w[i] << " ";
	}
	return 0;
}
2024/3/31 15:09
加载中...