Submission #1027099

#TimeUsernameProblemLanguageResultExecution timeMemory
1027099giorgi_pkhaladzeExhibition (JOI19_ho_t2)C++14
50 / 100
100 ms2904 KiB
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define ff first
#define ss second
using namespace std;
const int N=2*1e5;
int n,m,k,i,j,ans;
signed main() {
	cin>>n>>m;
 	vector<int> a(m);
	vector<pii> p(n);
	for(int k=0; k<n; k++){
		int x,y;
		cin>>x>>y;
		p[k]={y,x};
	}
	for(int k=0; k<m; k++){
		int x;
		cin>>x;
		a[k]=x;
	}
	sort(p.rbegin(),p.rend());
	sort(a.rbegin(),a.rend());
	ans=0;
	for(int k=0; k<n; k++){
		if(p[k].ss<=a[ans])ans++;
	}
	cout<<ans;
  	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...