Submission #1135601

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135601		Hamed_Ghaffari	Exhibition (JOI19_ho_t2)	C++20	100 / 100	38 ms	1924 KiB

joi2019_ho_t2

#include<bits/stdc++.h>
using namespace std;

const int MXN = 1e5+5;

int n, m, S[MXN], V[MXN], C[MXN], ord[MXN];

bool chk(int x) {
  int pt = m-x+1;
  for(int i=1; i<=n; i++)
    if(pt<=m && S[ord[i]]<=C[pt]) pt++;
  return pt>m;
}

int32_t main() {
  cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for(int i=1; i<=n; i++) {
    cin >> S[i] >> V[i];
    ord[i] = i;
  }
  sort(ord+1, ord+n+1, [&](int i, int j) {
    return V[i]<V[j] || (V[i]==V[j] && S[i]<S[j]);
  });
  for(int i=1; i<=m; i++) cin >> C[i];
  sort(C+1, C+m+1);
  int l=0, r=min(n,m)+1;
  while(r-l>1)
    (chk(l+r>>1) ? l : r) = l+r>>1;
  cout << l << '\n';
  return 0;
}

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