제출 #516218

#제출 시각아이디문제언어결과실행 시간메모리
516218thomas_liExhibition (JOI19_ho_t2)C++17
0 / 100
1 ms312 KiB
#include <bits/stdc++.h>
using namespace std;
const int MM = 1e5+5;
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n,m; cin >> n >> m;
	vector<array<int,2>> a; vector<int> b;
	for(int i = 0; i < n; i++){
		int s,v; cin >> s >> v;
		a.push_back({v,s});
	}
	sort(a.begin(),a.end());
	for(int j = 0; j < m; j++){
		int c; cin >> c;
		b.emplace_back(c);
	}
	sort(b.begin(),b.end());
	int ans = 0;
	for(int i = 0,j = 0; i < n; i++){
		while(j < m && b[j] < a[i][1]) j++;
		if(j != m) ans++,j++;
	}
	cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...