Submission #428250

#	Time	Username	Problem	Language	Result	Execution time	Memory
428250		Berted	Exhibition (JOI19_ho_t2)	C++14	0 / 100	2 ms	332 KiB

joi2019_ho_t2

#include <iostream>
#include <algorithm>
#define pii pair<int, int>
#define fst first
#define snd second

using namespace std;

int N, M;
pii A[100001]; int B[100001];

int main()
{
	ios :: sync_with_stdio(0); cin.tie(0);
	cin >> N >> M;
	for (int i = 0; i < N; i++) cin >> A[i].snd >> A[i].fst;
	for (int i = 0; i < M; i++) cin >> B[i];

	sort(A, A + N, greater<pii>());
	sort(B, B + N, greater<int>());

	int i = 0, j = 0;
	for (i = 0; i < M; i++)
	{
		for (; j < N; j++)
		{
			if (A[j].snd <= B[i]) {break;}
		}
		if (j == N) {break;}
		else {j++;}
	}
	cout << i << "\n";
	return 0;
}

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