Submission #221852

#	Time	Username	Problem	Language	Result	Execution time	Memory
221852		Cantfindme	Exhibition (JOI19_ho_t2)	C++17	100 / 100	213 ms	2808 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
typedef pair<pi,int> pp;
#define p(x,y,z) pp(pi(x,y),z)
const int maxn = 100010;

int n,m;
priority_queue <int, vector<int>,greater<int>> pq;

int32_t main() {
	cin >> n >> m;
	vector <pi> paints(n);
	vector <int> frames(m);
	for (int i =0;i<n;i++) {
		cin >> paints[i].s >> paints[i].f;
	}
	for (int i =0;i<m;i++) {
		cin >> frames[i];
	}
	
	sort(frames.rbegin(),frames.rend());
	sort(paints.rbegin(),paints.rend());
	
	int index = 0,ans=0;
	for (int i =0;i<m;i++) {
		while (index != n and paints[index].s > frames[i]) {
			index++;
		}
		if (index == n) break;
		ans++;
		index++;
	}
	cout << ans;
}

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