제출 #119278

#제출 시각아이디문제언어결과실행 시간메모리
119278tutisExhibition (JOI19_ho_t2)C++17
100 / 100
83 ms6672 KiB
/*input
8 8
508917604 35617051
501958939 840246141
485338402 32896484
957730250 357542366
904165504 137209882
684085683 775621730
552953629 20004459
125090903 607302990
433255278
979756183
28423637
856448848
276518245
314201319
666094038
149542543

*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
	ios_base::sync_with_stdio(false);
	ll n, m;
	cin >> n >> m;
	vector<pair<ll, ll>>x;
	while (n--)
	{
		ll s, v;
		cin >> s >> v;
		x.push_back({v, s});
	}
	sort(x.begin(), x.end(), greater<pair<ll, ll>>());
	vector<ll>cc;
	for (auto i : x)
		cc.push_back(i.second);
	vector<ll>c(m);
	for (ll &i : c)
		cin >> i;
	sort(c.begin(), c.end());
	ll ans = 0;
	for (ll i : cc)
	{
		if (c.size() > 0 && c.back() >= i)
		{
			ans++;
			c.pop_back();
		}
	}
	cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...