oj.uz

답안 #1019163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019163 2024-07-10T14:24:40 Z adrielcp Exhibition (JOI19_ho_t2) C++17
100 / 100
 43 ms 5724 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()
 
void solve() {
  int n,m;cin>>n>>m;
  vector<pair<int, int>> a(n);
  vector<int> c(m);
  for (int i = 0; i < n; i++) cin >> a[i].second >> a[i].first;
  for (int i = 0; i < m; i++) cin >> c[i];
 
  sort(all(a));
  sort(all(c));
 
  // max no. of pictures at frame 1 to i
  int j = m-1;
  int ans = 0;
  for (int i = n-1; i >= 0 && j >= 0; i--) {
    if (c[j] >= a[i].second) {
      ans++;
      j--;
    }
  }

  cout << ans << endl;
}
 
int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();
 
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 34 ms 5460 KB Output is correct
39 Correct 30 ms 5464 KB Output is correct
40 Correct 30 ms 5724 KB Output is correct
41 Correct 32 ms 5468 KB Output is correct
42 Correct 33 ms 5460 KB Output is correct
43 Correct 32 ms 5468 KB Output is correct
44 Correct 32 ms 5584 KB Output is correct
45 Correct 43 ms 5456 KB Output is correct
46 Correct 32 ms 5624 KB Output is correct
47 Correct 31 ms 4956 KB Output is correct
48 Correct 29 ms 4948 KB Output is correct
49 Correct 27 ms 4444 KB Output is correct
50 Correct 28 ms 4444 KB Output is correct
51 Correct 40 ms 5716 KB Output is correct
52 Correct 35 ms 5712 KB Output is correct
53 Correct 32 ms 5492 KB Output is correct
54 Correct 29 ms 5716 KB Output is correct
55 Correct 33 ms 5712 KB Output is correct
56 Correct 26 ms 3932 KB Output is correct
57 Correct 12 ms 2140 KB Output is correct
58 Correct 20 ms 3928 KB Output is correct
59 Correct 20 ms 3816 KB Output is correct
60 Correct 14 ms 2140 KB Output is correct
61 Correct 20 ms 3284 KB Output is correct
62 Correct 34 ms 5612 KB Output is correct
63 Correct 32 ms 5468 KB Output is correct
64 Correct 33 ms 5612 KB Output is correct
65 Correct 38 ms 5464 KB Output is correct
66 Correct 32 ms 5724 KB Output is correct
67 Correct 32 ms 5492 KB Output is correct
68 Correct 37 ms 5456 KB Output is correct
69 Correct 35 ms 5496 KB Output is correct
70 Correct 33 ms 5468 KB Output is correct
71 Correct 32 ms 5456 KB Output is correct
72 Correct 33 ms 5468 KB Output is correct
73 Correct 31 ms 5720 KB Output is correct