Problem p02689 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\\n"
#define int long long
#define printclock                                                             \\
  cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 1000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
  if (!b)
    return a;
  return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
  ll res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
void solve() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
signed main() {
  fastio();
  // cout<<fixed<<setprecision(20);
  // CHECK for LONG LONG and LONG DOUBLE
  //*comment for all except cc/cf
  ll n, m;
  cin >> n >> m;
  ll h[n];
  for (ll i = 0; i < n; i++)
    cin >> h[i];
  ll a2[100000];
  fill(a2, 0);
  for (ll i = 0; i < m; i++) {
    ll a, b;
    cin >> a >> b;
    a2[a - 1] = max(a2[a - 1], h[b - 1]);
    a2[b - 1] = max(a2[b - 1], h[a - 1]);
  }
  ll ans = 0;
  for (ll i = 0; i < n; i++) {
    ans += (h[i] > a2[i]);
  }
  cout << ans << endl;

  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\\n"
#define int long long
#define printclock                                                             \\
  cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 1000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
  if (!b)
    return a;
  return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
  ll res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
void solve() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
signed main() {
  fastio();
  // cout<<fixed<<setprecision(20);
  // CHECK for LONG LONG and LONG DOUBLE
  //*comment for all except cc/cf
  ll n, m;
  cin >> n >> m;
  ll h[n];
  for (ll i = 0; i < n; i++)
    cin >> h[i];
  vector<pair<ll, ll>> p;
  while (m--) {
    ll x, y;
    cin >> x >> y;
    p.pb({y, x});
  }
  /*for(ll i=0;i<p.size();i++){
    cout<<p[i].ff<<" "<<p[i].ss<<endl; ;
  }*/
  ll cnt = 0;
  for (ll i = 0; i < n; i++) {
    bool ok = 1;
    for (ll j = 0; j < p.size(); j++) {
      if (p[j].ff == (i + 1)) {
        if (h[p[j].ss - 1] >= h[i]) {
          // cout<<i+1<<"@$@$@$$"<<endl;
          ok = 0;
          break;
        }
      } else if (p[j].ss == (i + 1)) {
        if (h[p[j].ff - 1] >= h[i]) {
          // cout<<i+1<<"@$@$@$$"<<endl;
          ok = 0;
          break;
        }
      }
    }
    if (ok == 1) {
      cnt++;
    }
  }
  cout << cnt << endl;
  // printclock;
  return 0;
}