제출 #129369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129369		Dajunctic	Exhibition (JOI19_ho_t2)	C++17	100 / 100	245 ms	2812 KiB

joi2019_ho_t2

/*
 _   ________   ___       __ ___   _           _  _
| | / /|  _  \ / _ \     / // _ \ | |         | |(_)
| |/ / | | | |/ /_\ \   / // /_\ \| | __ __ _ | | _
|    \ | | | ||  _  |  / / |  _  || |/ // _` || || |
| |\  \| |/ / | | | | / /  | | | ||   <| (_| || || |
\_| \_/|___/  \_| |_//_/   \_| |_/|_|\_\\__,_||_||_|
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+50;
const int mod = 1e9+7;
#define size sdkdsf
#define pb push_back
const int in = 1e9+9;
typedef pair<int,int> ii;
int n, m;
struct Exhibition{
	int s, v;
} Pictures[N];
int size[N];
#define fi first
#define se second
signed main(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> Pictures[i].s >> Pictures[i].v;
	}
	for(int i=1;i<=m;i++) cin >> size[i];
	sort(Pictures+1,Pictures+n+1,[](Exhibition _a,Exhibition _b){return _a.v > _b.v or (_a.v == _b.v and _a.s > _b.s);});
	sort(size+1,size+m+1,greater<int>());
	int it = 1;
	for(int i=1;i<=n;i++){
		if(it<=m and Pictures[i].s <= size[it]) it++;
	}
	cout << it-1;
}

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