제출 #572075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572075		1ne	Exhibition (JOI19_ho_t2)	C++14	50 / 100	52 ms	5596 KiB

joi2019_ho_t2

#include<bits/stdc++.h>
using namespace std;
const long long mxn = 1e12;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	long long n,m;cin>>n>>m;
	vector<pair<long long ,long long>>arr(n);
	for (int i = 0;i<n;++i){
		cin>>arr[i].second>>arr[i].first;
	}
	vector<long long >brr(m);
	for (int i = 0;i<m;++i)cin>>brr[i];
	sort(brr.begin(),brr.end());
	sort(arr.begin(),arr.end());
	//find a longest subsequence that arr[j].first<=brr[i]
	int ans = m - 1;
	for (int i = n - 1;i>=0;--i){
		if (arr[i].second<=brr[ans]){
			--ans;
		}
	}
	cout<<m - ans - 1<<'\n';
	return 0;
}

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