Submission #1257492

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257492		nlsosad	Exhibition (JOI19_ho_t2)	C++20	100 / 100	104 ms	2040 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
pair<int, int> a[100001];
int b[100001];
int main(){
	int n, m;
	cin >> n >> m;
	for (int i = 1;i<=n;++i){
		cin >> a[i].f >> a[i].s;
	}
	for (int i = 1;i<=m;++i){
		cin >> b[i];
	}
	sort(b+1,b+m+1);
	sort(a+1,a+n+1, [](pair<int, int> p, pair<int, int> q){
		if(p.s!=q.s){
			return p.s<q.s;
		}else return p.f < q.f;
	});
	int tro = m;
	int res = 0;
	for (int i = n;i>=1;--i){
		if(a[i].f <= b[tro]){
			tro--;
			res++;
		}
	}
	cout << res;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50