제출 #533609

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

joi2019_ho_t2

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define cd complex<double>
#define p_q priority_queue
using namespace std;


int main(){
	AquA;
	int n,m;
	cin >> n >> m;
	vector<pair<int,int> > v(n);
	vector<int> p(m);
	for(int i=0;i<n;i++){
		cin >> v[i].sc >> v[i].fs;
	}
	sort(v.begin(),v.end());
	for(int i=0;i<m;i++){
		cin >> p[i];
	}
	sort(p.begin(),p.end());
	assert(n<=10);
	int ans=0;
	for(int i=0;i<(1<<n);i++){
		vector<int> h;
		for(int j=0;j<n;j++){
			if((i>>j)&1){
				h.push_back(v[j].sc);
			}
		}
		int nw=0;
		int flag=0;
		/*
		for(int i=0;i<(int)h.size()-1;i++){
			if(h[i]>h[i+1]){
				flag=1;
				break;
			}
		}
		*/
		for(auto y:h){
			if(nw==m){
				flag=1;
				break;	
			}
			while(nw<m){
				if(p[nw]>=y){
					nw++;
					break;
				}
				nw++;
			}
		}
		if(flag==0){
			ans=max(ans,(int)h.size());
		}
	}
	cout << ans << "\n";
	return 0;
}

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