Submission #2214849

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}

bool like[10];

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

  rep(i,10)like[i] = true;

  string N ; 
  ll K ;
  cin >> N >> K ;

  
  rep(i,K){
    ll inp; cin >> inp;
    like[inp] = false;
  }

  vector<ll> num;
  
  rep(i,10){
    if(like[i])  num.pb(i);
  }


  bool flag = false;
  rep(i,N.size()){
    if(flag) cout << num[0];
    else{
      rep(j, num.size()){
	if(num[j] ==( N[i]-'0')){cout << num[j]; break;}
	if(num[j] > (N[i]-'0')){cout << num[j]; flag = true; break;}
      }
    }
  }
  cout << endl;
  //cout << fixed << setprecision(16) << ans << endl;
  return 0;
}

Submission Info

Judge Result