제출 #262381

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

joi2019_ho_t2

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define MAXN 100005
int n, m;
pair<int, int> pics[MAXN];
vector<int> frames;
int dp[MAXN];
int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<n; i++) {
		cin >> pics[i].second >> pics[i].first;
	}
	for (int i=0; i<m; i++) {
		frames.push_back(0);
		cin >> frames[i];
	}
	sort(frames.begin(), frames.end());
	for (int i=0; i<n; i++) {
		pics[i].second = lower_bound(frames.begin(), frames.end(), pics[i].second)-frames.begin();
	}
	sort(pics, pics+n);
	dp[n] = 0;
	for (int i=n-1; i>=0; i--) {
		dp[i] = min(dp[i+1]+1, m-pics[i].second);
	}
	cout << dp[0] << endl;
}

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