제출 #1317755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1317755		vtnoo	Exhibition (JOI19_ho_t2)	C++20	0 / 100	0 ms	332 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end() 
#define ii pair<ll,ll>
#define fst first
#define snd second
using namespace std;
const int MAXN=1e5+5;
bool used[MAXN];
int main(){
	int n,m;cin>>n>>m;
	vector<ll>s(n),v(n);
	for(int i=0;i<n;i++)cin>>s[i]>>v[i];
	vector<ll>c(m);
	for(int i=0;i<m;i++)cin>>c[i];		
	sort(all(c));
	int ans=0;
	ll last=0;
	for(int i=0;i<m;i++){
		ii p={1e18,1e18};
		for(int j=0;j<n;j++){
			if(used[j])continue;
			if(v[j]<last)continue;
			if(s[j]<=c[i]){
				p=min(p,ii{v[j],j});
			}
		}
		if(p.snd==1e18)continue;
		last=p.fst;
		used[p.snd]=1;
		ans++;
	}
	cout<<ans<<endl;
}

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