Submission #1165268

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165268		Tsagana	Exhibition (JOI19_ho_t2)	C++20	50 / 100	31 ms	2832 KiB

joi2019_ho_t2

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

void solve () {
	int n, m;
	cin >> n >> m;

	vector<array<int, 2> > v(n);
	vector<int> c(m);
	for (auto &x: v) cin >> x[1] >> x[0];
	for (int &x: c) cin >> x;

	sort(v.rbegin(), v.rend());
	sort(c.rbegin(), c.rend());

	int j = 0;
	for (int i = 0; i < n; i++)
		if (v[i][1] <= c[j]) j++;
	cout << j << '\n';
}
signed main() {IOS solve(); return 0;}

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