oj.uz

답안 #364723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364723 2021-02-09T20:07:21 Z tushar_2658 Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 364 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 200005;
using ll = long long;

pair<ll, ll> p[maxn];
ll c[maxn];

int main(int argc, char const *argv[])
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n, m;
  cin >> n >> m;
  for(int i = 1; i <= n; ++i){
    cin >> p[i].first >> p[i].second;
  }
  for(int i = 1; i <= m; ++i){
    cin >> c[i];
  }
  sort(p + 1, p + n + 1, [&](pair<int, int> x, pair<int, int> y){
    return x.second < y.second;
  });
  sort(c + 1, c + m + 1); 
  int ptr = n, ans = 0; 
  for(int i = m; i > 0 && ptr > 0; --i){
    while(ptr > 0 && p[ptr].first > c[i]){
      --ptr;
    }
    if(ptr > 0 && p[ptr].first <= c[i]){
      ++ans;
      --ptr;
    }
  }
  cout << ans << '\n';

  return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -