Submission #2531114

---

Source Code Expand

#include <bits/stdc++.h>
//#define int long long

using namespace std;
using LL = long long;
using P = pair<int, int>;

#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)

#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()

const int INF = (int)1e9;
const LL INFL = (LL)1e15;
const int MOD = 1e9 + 7;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

/*************** using variables **************/
int n, m;
vector<bool> close;
/**********************************************/

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n >> m;
    
    stack<int> ans;
    close.resize(n);
    REP(i, m){
        int a;
        cin >> a;
        ans.push(a);
    }
    REP(i, n){
        if(!close[ans.top()-1]) cout << ans.top() << endl;
        close[ans.top()-1] = true;
        ans.pop();
    }
    REP(i, n){
        if(!close[i]) cout << i+1 << endl;
    }
}

Submission Info

Judge Result