제출 #207024

#제출 시각아이디문제언어결과실행 시간메모리
207024SaboonExhibition (JOI19_ho_t2)C++14
100 / 100
103 ms8824 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
const int maxn = 1e5 + 10;

pair<int,int> a[maxn];

int main(){
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> a[i].second >> a[i].first;
	multiset<int> s;
	for (int i = 0; i < m; i++){
		int b;
		cin >> b;
		s.insert(-b);
	}
	sort(a, a + n);
	int ans = 0;
	for (int i = n - 1; !s.empty() and i >= 0; i--){
		int t = -(*s.begin());
		if (t >= a[i].second){
			ans ++;
			s.erase(s.begin());
		}
	}
	cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...