oj.uz

Submission #765448

# Submission time Handle Problem Language Result Execution time Memory
765448 2023-06-24T13:34:40 Z ind1v Exhibition (JOI19_ho_t2) C++11
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 100005;

int n, m;
int s[N], v[N], c[N];
int ord[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> s[i] >> v[i];
  }
  for (int i = 1; i <= m; i++) {
    cin >> c[i];
  }
  iota(ord + 1, ord + n + 1, 1);
  sort(ord + 1, ord + n + 1, [](int &i, int &j) -> bool {
    return v[i] > v[j] || (v[i] == v[j] && c[i] > c[j]);
  });
  sort(c + 1, c + m + 1, greater<int>());
  int ans = 0;
  for (int i = 1, j = 1; i <= m; i++) {
    while (j < n && s[ord[j]] > c[i]) {
      ++j;
    }
    if (j <= n && s[ord[j]] <= c[i]) {
      ++ans;
      ++j;
    }
  }
  cout << ans;
  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 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 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 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 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -