oj.uz

Submission #654345

# Submission time Handle Problem Language Result Execution time Memory
654345 2022-10-31T04:19:55 Z Shin Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

const int N = 1e5 + 7;
int b[N];
pair<int, int> a[N];

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  for (int i = 1; i <= n; i ++) {
    cin >> a[i].se >> a[i].fi;
  }
  for (int i = 1; i <= m; i ++) {
    cin >> b[i];
  }
  sort(a + 1, a + n + 1);
  sort(b + 1, b + m + 1);
  int res = 0;
  for (int i = m, j = n - 1; i > 0 && j > 0; i --) {
    while (j > 0 && a[j].se > b[i]) {
      j --;
    }
    if (j > 0) {
      j --;
      res ++;
    }
  }
  cout << res;
  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -