Submission #3004914

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<functional>
#include<iomanip>
#include<queue>
#include<cassert>
#include<tuple>
#include<set>
#include<map>
#include<list>
#include<bitset>
#include<utility>

#define PB push_back
#define ALL(a)  (a).begin(),(a).end()
#define all(v) begin(v), end(v)
#define DWN(a)  (a).begin(),(a).end(), greater<int>()
#define rep(i, m) for (int i = 0; i < m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int inf = (int)1e9;
const ll INF = (ll)1e18;
const ll MOD{ (ll)1e9 + 7 };
const long double EPS = 1e-10;

int main() {
	int n, m;
	cin >> n >> m;
	
	int a[100010];
	rep(i, m) cin >> a[i];
	
	reverse(a, a + m);
	
	bool b[100010];
	rep(i, n) b[i] = true;
	
	rep(i, m) {
		if (b[a[i] - 1]) {
			cout << a[i] << endl;
			b[a[i] - 1] = false;
		}
	}
	rep(i, n) {
		if (b[i]) {
			cout << i + 1 << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result