Submission #3387572

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
int al[100001];

int main(int argc, char const* argv[])
{
  int n, m;
  cin >> n >> m;
  vector<int> a;
  for(int i = 0; i < m; i++){
    int b;
    cin >> b;
    a.pb(b);
  }
  for(int i = m - 1; i >= 0; i--){
    if(al[a[i]] != 1){
      cout << a[i] << endl;
      al[a[i]] = 1;
    }
  }
  for(int i = 1; i <= n; i++){
    if(al[i] != 1){
      cout << i << endl;
    }
  }
	return 0;
}

Submission Info

Judge Result