Submission #465117

#TimeUsernameProblemLanguageResultExecution timeMemory
465117HalitExhibition (JOI19_ho_t2)C++17
100 / 100
194 ms5544 KiB
// author: Halit
#include <bits/stdc++.h>

int main() {
  int n, m;
  std::cin >> n >> m;

  std::vector<std::array<int64_t, 2>> a(n);
  for (auto &[x, y] : a) {
    std::cin >> x >> y;
    std::swap(x, y);
  }

  std::vector<int64_t> c(m);
  for (int64_t &el : c) std::cin >> el;

  std::sort(c.rbegin(), c.rend()); 
  std::sort(a.rbegin(), a.rend());

  int j = 0;
  for (int i = 0;i < n && j < m; ++i) {
    if (a[i][1] > c[j]) continue;
    else j += 1; 
  }

  std::cout << j;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...