제출 #864042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864042		Arthas	Exhibition (JOI19_ho_t2)	C++17	100 / 100	40 ms	5740 KiB

joi2019_ho_t2

/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 1e5 + 8, M = 1e5 + 8, SQ = 500, INF = 1e18 + 8, LGN = 11, mod = 998244353;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, cnt[N], a[N];
pii p[N];
vector <int> v;

int32_t main(){
  fast_io;
  cin >> n >> m;
  FOR (i, 0, n){
    cin >> p[i].S >> p[i].F;
  }
  FOR (i, 0, m){
    cin >> a[i];
  }
  sort (p, p + n);
  sort (a, a + m);
  int pt = m - 1;
  for (int i = n - 1; i >= 0; -- i){
    if (p[i].S <= a[pt]){
      -- pt;
    }
  }
  cout << (m - pt - 1);
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

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