Submission #156548

#	Time	Username	Problem	Language	Result	Execution time	Memory
156548		Evirir	Exhibition (JOI19_ho_t2)	C++17	100 / 100	68 ms	5752 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 watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define F first
#define S second
#define INF 2e14
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

#define MAXN 100005

int n,m;
ii e[MAXN];
ll f[MAXN];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m;
	forn(i,0,n) cin>>e[i].S>>e[i].F;
	forn(i,0,m) cin>>f[i];
	
	sort(e,e+n,greater<ii>());
	sort(f,f+m,greater<ll>());
	
	int ptr=0,ans=0;
	forn(i,0,n){
		if(e[i].S<=f[ptr]){
			ans++;
			ptr++;
		}
		if(ptr==m) break;
	}
	
	cout<<ans<<'\n';
	
	return 0;
}

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