제출 #526383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526383		bebecanvas	Exhibition (JOI19_ho_t2)	C++14	50 / 100	55 ms	13492 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
#define sz(x) (int) (x).size()

int n, m;
pair<int, int> p[100005];
int f[100005];
int memo[1005][1005];
int dp(int i, int j){
	if(memo[i][j]!=-1){return memo[i][j];}
	if(i==n||j==m){return memo[i][j]= 0;}
	if(p[i].second<=f[j]){
		return memo[i][j]= max(dp(i+1, j+1)+1, max(dp(i, j+1), dp(i+1,j)));
	}else{
		return memo[i][j]= max(dp(i, j+1), dp(i+1,j));
	}
}

signed main(){
 
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    cin >> n >> m;
	for(int i=0; i<n; i++){
		int a, b; cin >> a >> b;
		p[i]= make_pair(b, a);
	}
	for(int i=0; i<m; i++){cin >> f[i];}
	sort(f, f+m);
	sort(p, p+n);
	memset(memo, -1, sizeof(memo));
	
	int ans= dp(0, 0);
	
	cout << ans << endl;
	
	
	
}

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