제출 #865868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865868		phoenix0423	Exhibition (JOI19_ho_t2)	C++17	100 / 100	42 ms	4692 KiB

joi2019_ho_t2

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 3000 + 5;
const int INF = 1e9;
const double eps = 1e-7;

struct info{
	int s, v;
	info(){}
	info(int _s, int _v) : s(_s), v(_v){}
	bool operator < (const info& other) const{
		return v < other.v || (v == other.v && s < other.s);
	}
};

int main(void){
	fastio;
	int n, m;
	cin>>n>>m;
	vector<info> a(n);
	for(int i = 0; i < n; i++){
		int s, v;
		cin>>s>>v;
		a[i] = info(s, v);
	}
	vector<int> c(m);
	for(int i = 0; i < m; i++) cin>>c[i];
	sort(c.begin(), c.end());
	int ans = 0, cur = m - 1;
	sort(a.begin(), a.end());
	for(int i = n - 1; i >= 0; i--){
		if(cur < 0) break;
		if(c[cur] >= a[i].s) ans++, cur--;
	}
	cout<<ans<<"\n";
}

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