Submission #1220016

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220016		kxd	Art Exhibition (JOI18_art)	C++20	0 / 100	1095 ms	320 KiB

art

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 1e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

pii p[N];
int f[N];

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n, m;
	cin >> n >> m;
	forn(i,n) {
		cin >> p[i].sd >> p[i].ft; // ft - val , sd - sz
	}
	sort(p,p+n,[](pii a, pii b) {return a > b;});
	forn(i,m) {
		cin >> f[i];
	}
	sort(f,f+m,[](int a, int b) {return a > b;});
	int j = 0; // pic #
	forn(i,m) {
		while(j<n && f[i]<p[j].sd) j++;
		if(j>=n) {
			cout << i;
			return 0;
		}
		j++;
	}
	cout << m << endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50