제출 #139707

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
139707		math0_0	Exhibition (JOI19_ho_t2)	C++11	100 / 100	320 ms	6932 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> pl;

bool ss(pl a, pl b){
	if(a.first != b.first){
		return (a.first > b.first);
	}
	else{
		return (a.second > b.second);
	}
}

int main(){
	ll n, m;
	cin >> n >> m;
	vector<pl> pics; vector<ll> frames;
	
	for(ll one = 0; one < n; one++){
		ll s, v;
		cin >> s >> v;
		
		pics.push_back(make_pair(v, s));//prioritise value first
	}
	sort(pics.begin(), pics.end(), ss);
	//biggest value to the front
	//same value then biggest size to the front
	
	frames.push_back(0);
	for(ll one = 0; one < m; one++){
		ll s;
		cin >> s;
		frames.push_back(s);
	}
	sort(frames.begin(), frames.end());
	
	ll ans = 0, idx = m;//idx = which frame now
	for(ll one = 0; one < n; one++){
		//cout << pics[one].first << ' ' << pics[one].second << endl;
		ll csz = frames[idx];
		//largest remaining frame
		if(pics[one].second <= csz){
			ans++;
			--idx;
		}
	}
	
	cout << ans;
}

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