Submission #2971803

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n, m;
typedef pair<long long, long long> P;
vector<P> v;

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	cin >> n >> m;
	for(int i=0; i<n; ++i)
		v.push_back(P(-1, n-i-1));
	for(int i=0; i<m; ++i){
		int a;
		cin >> a;
		v[a-1].first = i;
	}
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());
	for(int i=0; i<n; ++i)
		cout << n-v[i].second << "\n";
}

Submission Info

Judge Result