제출 #831185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831185		OAleksa	Exhibition (JOI19_ho_t2)	C++14	0 / 100	0 ms	212 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std; 
#define int long long
const int maxn = 1e5 + 69;
int n, m, s[maxn], v[maxn], c[maxn];

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while(tt--) {
		cin >> n >> m;
		for(int i = 0;i < n;i++) 
			cin >> s[i] >> v[i];
		for(int i = 0;i < m;i++)
			cin >> c[i];
		sort(c, c + m);
		vector<int> p(m);
		for(int i = 0;i < n;i++) {
			auto u = lower_bound(c, c + m, s[i]) - c;
			if(u != m) {
				++p[u];
				p[u] = min(p[u], m);
			}
		}
		for(int i = 1;i < m;i++)
			p[i] += p[i - 1];
		int ans = 0;
		for(int i = m - 1;i >= 0;i--) {
			if(p[i] >= m - i) 
				ans = m - i;
		}
		cout << ans << "\n";
	}
   return 0;
}

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