代码：

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int n, m, e[5002], code, bujige = 0, shang = 0;
struct chengji{
	int s = -1;
}cj[100000002];
bool cmp(chengji a, chengji b){
	if (a.s == b.s){
		return true;
	}
	return a.s > b.s;
}
int main() {
    cin >> n >> m;
    for(int i=1;i<=n;i++){
		cin >> e[i];
	}
	for(int i=1;i<=m;i++){
		cin >> code;
		cin >> cj[code].s;
		if(cj[code].s < 60){
			bujige++;
		}
	}
	sort(cj, cj + m);
	for(int i=0;i<=m;i++){
		if(cj[i].s != -1){
			shang++;
		}else{
			break;
		}
	}
	cout << n - shang << endl << bujige;
    return 0;
}

cmp函数报错