제출 #768396

#제출 시각아이디문제언어결과실행 시간메모리
768396LinkedArrayExhibition (JOI19_ho_t2)C++17
100 / 100
138 ms4392 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(int i = 0; i < n; i++){
	    cin >> picture[i].second >> picture[i].first;
	}
	for(int i = 0; i < m; i++){
	    cin >> frame[i]; 
	}
 
	sort(picture.begin(), picture.end()); 
	sort(frame.begin(), frame.end());
	
    int ans = 0, i = n - 1;
    while(i >= 0 && ans < m){
        if(picture[i].second <= frame[m - 1 - ans]){
            ans++;
        }
        i--;
    }
	cout << ans << endl;
  
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...