oj.uz

답안 #864042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864042 2023-10-21T18:36:09 Z Arthas Exhibition (JOI19_ho_t2) C++17
100 / 100
 40 ms 5740 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 1e5 + 8, M = 1e5 + 8, SQ = 500, INF = 1e18 + 8, LGN = 11, mod = 998244353;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m, cnt[N], a[N];
pii p[N];
vector <int> v;

int32_t main(){
  fast_io;
  cin >> n >> m;
  FOR (i, 0, n){
    cin >> p[i].S >> p[i].F;
  }
  FOR (i, 0, m){
    cin >> a[i];
  }
  sort (p, p + n);
  sort (a, a + m);
  int pt = m - 1;
  for (int i = n - 1; i >= 0; -- i){
    if (p[i].S <= a[pt]){
      -- pt;
    }
  }
  cout << (m - pt - 1);
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2516 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2516 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2532 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2648 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2516 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2532 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2648 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 35 ms 5468 KB Output is correct
39 Correct 33 ms 5460 KB Output is correct
40 Correct 36 ms 5620 KB Output is correct
41 Correct 35 ms 5712 KB Output is correct
42 Correct 35 ms 5724 KB Output is correct
43 Correct 35 ms 5716 KB Output is correct
44 Correct 36 ms 5460 KB Output is correct
45 Correct 35 ms 5456 KB Output is correct
46 Correct 34 ms 5468 KB Output is correct
47 Correct 35 ms 5468 KB Output is correct
48 Correct 31 ms 5268 KB Output is correct
49 Correct 28 ms 4944 KB Output is correct
50 Correct 28 ms 4956 KB Output is correct
51 Correct 34 ms 5460 KB Output is correct
52 Correct 34 ms 5716 KB Output is correct
53 Correct 39 ms 5740 KB Output is correct
54 Correct 29 ms 5724 KB Output is correct
55 Correct 35 ms 5716 KB Output is correct
56 Correct 22 ms 4444 KB Output is correct
57 Correct 14 ms 3416 KB Output is correct
58 Correct 22 ms 4480 KB Output is correct
59 Correct 21 ms 4440 KB Output is correct
60 Correct 14 ms 3420 KB Output is correct
61 Correct 23 ms 4440 KB Output is correct
62 Correct 35 ms 5624 KB Output is correct
63 Correct 35 ms 5488 KB Output is correct
64 Correct 35 ms 5460 KB Output is correct
65 Correct 35 ms 5480 KB Output is correct
66 Correct 35 ms 5456 KB Output is correct
67 Correct 40 ms 5620 KB Output is correct
68 Correct 35 ms 5704 KB Output is correct
69 Correct 36 ms 5612 KB Output is correct
70 Correct 36 ms 5460 KB Output is correct
71 Correct 34 ms 5460 KB Output is correct
72 Correct 36 ms 5628 KB Output is correct
73 Correct 37 ms 5516 KB Output is correct