Submission #372480

#TimeUsernameProblemLanguageResultExecution timeMemory
372480mariowongExhibition (JOI19_ho_t2)C++14
100 / 100
64 ms5740 KiB
#include <bits/stdc++.h>
using namespace std;

long long n,m,pt,b[100005];
pair<long long,long long> a[100005];
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for (int i=1;i<=n;i++){
		cin >> a[i].second >> a[i].first;
	}
	for (int i=1;i<=m;i++){
		cin >> b[i];
	}
	sort(a+1,a+1+n); pt=m; sort(b+1,b+1+m); 
	for (int i=n;i>=1;i--){
		if (pt > 0 && b[pt] >= a[i].second)
		pt--;
	}
	cout << m-pt << "\n";
	return 0;
}	
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...