Submission #768123

#TimeUsernameProblemLanguageResultExecution timeMemory
768123LinkedArrayExhibition (JOI19_ho_t2)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h>
using namespace std;
 
int main(){
	int n, m;
	cin>>n>>m;
 
	vector<pair<int, int>> picture(n);
	vector<int> frame(m);
	
	for(auto &[a, b] : picture){
	    cin >> a >> b;
	}
	for(auto &a : frame){
	    cin >> a; 
	}
 
	sort(picture.begin(), picture.end()); 
	sort(frame.begin(), frame.end());
	
	int ans = 0, j = m-1;
	int i = n - 1;
	
	while(i >= 0){
		if(picture[i].first <= frame[j]){
		    ++ans;
		    j--;
		}
		i--;
	}
	cout << ans << endl;
  
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...