Problem p02689 (C++) — buggy submission, verdict: Runtime Error

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

using ll = long long int;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()

#define pi 3.14159265358979

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

ll cnt_rep = 0;
ll powmod(ll N, ll P, ll M) {
  cnt_rep++;
  if (P == 0)
    return 1;
  if (P % 2 == 0) {
    ll t = powmod(N, P / 2, M);
    return t * t % M;
  }
  return (N * powmod(N, P - 1, M)) % M;
}

ll gcd(ll a, ll b) {
  ll resi, g, l;
  if (a > b) {
    g = a;
    l = b;
  } else if (b > a) {
    g = b;
    l = a;
  } else {
    return a;
  }
  resi = g % l;
  if (resi != 0) {
    return gcd(l, resi);
  } else {
    return l;
  }
}

template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
  vector.erase(vector.begin() + index);
}

int ans = 0;
int N, M, Q;

template <typename T> void showall(vector<T> v) {
  rep(i, 0, v.size()) { cout << v[i] << " "; }
  cout << endl;
}

void dfs(vector<ll> ls, vector<vector<ll>> way, int) {
  ll cur = ls.back();
  ls.pop_back();

  rep(i, 0, N) {
    if (way[cur][i] != 0) {
    }
  }
}

int main() {
  ll N, M;
  cin >> N >> M;
  int ans = 0;

  vector<ll> H(N), v(N, 0);
  map<int, int> s;
  vector<map<int, int>> ls(N, s);

  rep(i, 0, N) { cin >> H[i]; }
  rep(i, 0, M) {
    ll ai, bi;
    cin >> ai >> bi;

    ls[ai - 1][bi - 1] = 1;
    ls[bi - 1][ai - 1] = 1;
  }

  rep(i, 0, N) {
    bool flag = true;
    for (auto &ne : ls[i]) {
      if (H[ne.first] >= H[i]) {
        flag = false;
        break;
      }
    }
    if (flag) {
      ans++;
    }
  }

  cout << ans << endl;
}

Error: WA

Fixed submission:

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

using ll = long long int;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()

#define pi 3.14159265358979

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

ll cnt_rep = 0;
ll powmod(ll N, ll P, ll M) {
  cnt_rep++;
  if (P == 0)
    return 1;
  if (P % 2 == 0) {
    ll t = powmod(N, P / 2, M);
    return t * t % M;
  }
  return (N * powmod(N, P - 1, M)) % M;
}

ll gcd(ll a, ll b) {
  ll resi, g, l;
  if (a > b) {
    g = a;
    l = b;
  } else if (b > a) {
    g = b;
    l = a;
  } else {
    return a;
  }
  resi = g % l;
  if (resi != 0) {
    return gcd(l, resi);
  } else {
    return l;
  }
}

template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
  vector.erase(vector.begin() + index);
}

int ans = 0;
int N, M, Q;

template <typename T> void showall(vector<T> v) {
  rep(i, 0, v.size()) { cout << v[i] << " "; }
  cout << endl;
}

void dfs(vector<ll> ls, vector<vector<ll>> way, int) {
  ll cur = ls.back();
  ls.pop_back();

  rep(i, 0, N) {
    if (way[cur][i] != 0) {
    }
  }
}

int main() {
  ll N, M;
  cin >> N >> M;
  int ans;

  vector<ll> H(N), v(N, 0);
  vector<vector<ll>> way(N, v);
  map<int, int> s;
  vector<map<int, int>> ls(N, s);

  rep(i, 0, N) { cin >> H[i]; }
  rep(i, 0, M) {
    ll ai, bi;
    cin >> ai >> bi;

    ls[ai - 1][bi - 1] = 1;
    ls[bi - 1][ai - 1] = 1;
  }

  rep(i, 0, N) {
    bool flag = true;
    for (auto &ne : ls[i]) {
      if (H[ne.first] >= H[i]) {
        flag = false;
        break;
      }
    }
    if (flag) {
      ans++;
    }
  }

  cout << ans << endl;
}