제출 #129413

#제출 시각아이디문제언어결과실행 시간메모리
129413taozai281Exhibition (JOI19_ho_t2)C++14
100 / 100
73 ms2800 KiB
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
int n,m;
int s;
int v;
int c;
vector<pair<int,int> > pic;
vector<int> fr;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>s>>v;
		pic.push_back(make_pair(v,s));
	}
	for(int i=1;i<=m;i++){
		cin>>c;
		fr.push_back(c);
	}
	sort(pic.begin(),pic.end());
	sort(fr.begin(),fr.end());
	int ans=n-1;
	int res=0;
	for(int i=m-1;i>=0;i--)
	{
		while(ans>=0&&pic[ans].second>fr[i])
		{
			ans--;
		}
		if(ans>=0)
		{
			res++;
			ans--;
		}
		
	}
	cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...