Submission #73259820

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL_DEBUG
ifstream fin("B.in"); ofstream fout("B.out");
#else
auto& fin = cin; auto& fout = cout;
#endif

#define each(a, x)    for (auto& a : x)
#define  rep(i, a, b) for(int i   = a; i   < (b); ++i  )
#define   rp(b)       for(int _rp = 0; _rp < (b); ++_rp)
#define  all(x)       begin(x),  end(x)
#define rall(x)       rbegin(x), rend(x)
#define  exist(x, v)  ((x).find(v) != (x).end())
#define cexist(x, v)  (find(all(x), v) != (x).end())
#define sz(x)         (int)(x).size()
#define bg(x)         begin(x)
#define rsz resize
#define ins insert
#define pb  push_back
#define pf  push_front
#define ft  front()
#define bk  back()
#define fi  first
#define se  second
#define lb  lower_bound
#define ub  upper_bound
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define dedupe(x) do {sort(all(x)); (x).erase(unique(all(x)), (x).end());} while(0)
#define CT template<class T>
CT bool ckmin(T &a, const T &b) { return b < a ? (a = b, true) : false; }
CT bool ckmax(T &a, const T &b) { return b > a ? (a = b, true) : false; }
CT using V = vector<T>;  CT using   vv = V<V<T>>;  CT using  vvv = V<vv<T>>;
using   ll = long long;     using  ull = uint64_t;    using   ld = long double;
using  pii = pair<int,int>; using  pll = pair<ll,ll>; using  pdd = pair<ld,ld>;
using   vi = V<int>;        using   vl = V<ll>;       using   vd = V<ld>;
using   vb = V<bool>;       using   vc = V<char>;     using   vs = V<string>;
using  vpi = V<pii>;        using  vpl = V<pll>;      using  vpd = V<pdd>;
using  vvi = V<vi>;         using  vvl = V<vl>;       using  vvd = V<vd>;
using vvpi = V<vpi>;        using vvpl = V<vpl>;      using vvpd = V<vpd>;
using  pli = pair<ll,int>;  using vpli = V<pli>;     using vvpli = V<vpli>;
using  pil = pair<int,ll>;  using vpil = V<pil>;     using vvpil = V<vpil>;
using  t3i = tuple<int,int,int>;  using vti = V<t3i>;
using  t3l = tuple<ll ,ll ,ll >;  using vtl = V<t3l>;
CT using maxpq = priority_queue<T>;
CT using minpq = priority_queue<T, V<T>, greater<T>>; using i128 = __int128;
const int  INF = 1e9;   const ll LLINF = 4e18; const ll NTT = 998244353;


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M, K;
    fin >> N >> M >> K;
    vl p(N);
    each(x,p) fin>>x;
    rep(i,0,M) {
        int a,v;
        fin >> a >> v;
        a--;
        p[a]=v;
    }

    int cnt = 0;
    each(x,p) if (x < K) cnt++;
    fout << cnt << '\n';
    return 0;
}

Submission Info

Judge Result