Submission #62504237

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define endl '\n'
typedef long long ll;
typedef long double ld;
#define ull unsigned long long
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define L cout<<'\n'
#define sz(t) int(t.size())
#define RTV(t) return void(cout<<t<<endl)

void file() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
}

long long gcd(unsigned long long a, unsigned long long b) { return a ? gcd(b % a, a) : b; }

long long lcm(unsigned long long a, unsigned long long b) { return a / gcd(a, b) * b; }

void PRO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}


void solve() {
    int k,n;
    cin>>k>>n;
    vector<int>mp(1005);
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        mp[x] = 1;
    }
    vector<int>ans;
    for(int i=1;i<=k;i++){
        if(!mp[i])ans.push_back(i);
    }
    cout<<sz(ans)<<endl;
    for(auto&it : ans)cout<<it<<' ';L;
}

int32_t main() {
    file();
    PRO();
    int t = 1;
    //freopen("crypto.in", "r", stdin);
    //cin >> t;
    //clock_t en;en = clock();
    for (int i = 1; i <= t; i++) {
        //cout<<"Case #"<<i<<": ";
        solve();
    }
    //cout<<(ld)(clock()-en)/CLOCKS_PER_SEC<<endl;
    return 0;
}

Submission Info

Judge Result