Submission #1183044

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183044		lioow	Exhibition (JOI19_ho_t2)	C++20	100 / 100	32 ms	2632 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p2
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define lb long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
using namespace std;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int mod=1e9+7,maxn=1e5+5,N=5e5+5,INF=1e18;
const int MOD=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dir[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};

bool comp(pii x,pii y){
	if(x.se==y.se) return x.fi<y.fi;
	return x.se<y.se;
}
void solve(){
	int n,m;cin>>n>>m;
	pii a[n+2];
	int c[m+2];
	repp(i,1,n) cin>>a[i].fi>>a[i].se;
	repp(i,1,m) cin>>c[i];
	sort(a+1,a+n+1,comp);
	sort(c+1,c+m+1);
	int nw=n,ans=0;
	rep(i,m,1){
		while(nw>0 && a[nw].fi>c[i]) nw--;
		if(nw>=1) ans++,nw--;
	}
	cout<<ans<<endl;
}
// YYGYYYGGGGRGYYGRGRYG
// YYGYYGGGGY===
signed main(){
  liow;
  int t=1;
// cin>>t;
  while(t--){
  	solve();
  }
}

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