Submission #12772511

---

Source Code Expand

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

int main() {
  	int n,m; cin >> n >> m;
  	vector<long long> h(n);
  	for(int i = 0;i < n;i++) {
      	long long tmp; cin >> tmp;
    	h[i] = tmp;
    }
  
  	vector<vector<int>> ab(n);
  	for(int i = 0;i < m;i++) {
    	int a,b; cin >> a >> b;
      	a--;b--;
      	ab[a].push_back(b);
      	ab[b].push_back(a);
    }
  
  	int count = 0;
  	for(int i = 0;i < n;i++) {
        bool flg = true;
      	long long ab_size = ab[i].size();
      	long long hi = h[i];
      	for(int j = 0;j < ab_size;j++ ) {
        	if(hi <= h[ab[i][j]]) flg = false;
        }
      	if(flg) count++;
    }
	cout << count << "\n";
}

Submission Info

Judge Result