Submission #553900

#	Time	Username	Problem	Language	Result	Execution time	Memory
553900		AA_Surely	Exhibition (JOI19_ho_t2)	C++14	100 / 100	46 ms	1680 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int n, m;
int ms[N];
PII ns[N];

int main() {
    IOS;
    
    cin >> n >> m;
    F0R(i, n) cin >> ns[i].S >> ns[i].F;
    F0R(i, m) cin >> ms[i];

    sort(ns, ns + n);
    sort(ms, ms + m);
    
    int ptr = m - 1;
    R0F(i, n) {
        if (ptr < 0) break;
        if (ns[i].S <= ms[ptr]) ptr--;
    }

    cout << m - 1 - ptr;
}

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