답안 #977238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977238 2024-05-07T14:35:30 Z LOLOLO Exhibition (JOI19_ho_t2) C++17
100 / 100
44 ms 5268 KB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 2e5 + 100;

ll solve() {
    int n, m;
    cin >> n >> m;

    vector <pair <int, int>> pic;
    vector <int> fr;

    for (int i = 1; i <= n; i++) {
        int s, v;
        cin >> s >> v;
        pic.pb({v, s});
    }

    for (int i = 1; i <= m; i++) {
        int c;
        cin >> c;
        fr.pb(c);
    }

    sort(all(fr));
    sort(all(pic), [&] (pair <int, int> A, pair <int, int> B) {
        if (A.f != B.f)
            return A.f > B.f;

        return A.s > B.s;
    });

    int cnt = 0;
    for (auto x : pic) {
        if (sz(fr) && fr.back() >= x.s) {
            cnt++;
            fr.pop_back();
        }
    }

    return cnt;
}
 
int main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    cout.tie(NULL);
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        //solve();
        cout << solve() << '\n';
    }
 
    return 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 1 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 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 0 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 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 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 504 KB Output is correct
# 결과 실행 시간 메모리 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 1 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 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 456 KB Output is correct
19 Correct 0 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 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 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 504 KB Output is correct
38 Correct 37 ms 4812 KB Output is correct
39 Correct 36 ms 4844 KB Output is correct
40 Correct 33 ms 4864 KB Output is correct
41 Correct 37 ms 5048 KB Output is correct
42 Correct 38 ms 4816 KB Output is correct
43 Correct 38 ms 5036 KB Output is correct
44 Correct 37 ms 4824 KB Output is correct
45 Correct 42 ms 5016 KB Output is correct
46 Correct 36 ms 4820 KB Output is correct
47 Correct 32 ms 4564 KB Output is correct
48 Correct 32 ms 4560 KB Output is correct
49 Correct 30 ms 4208 KB Output is correct
50 Correct 30 ms 4056 KB Output is correct
51 Correct 41 ms 5156 KB Output is correct
52 Correct 40 ms 4820 KB Output is correct
53 Correct 37 ms 4864 KB Output is correct
54 Correct 31 ms 4812 KB Output is correct
55 Correct 39 ms 4936 KB Output is correct
56 Correct 23 ms 3284 KB Output is correct
57 Correct 14 ms 1756 KB Output is correct
58 Correct 25 ms 3288 KB Output is correct
59 Correct 23 ms 3284 KB Output is correct
60 Correct 15 ms 1756 KB Output is correct
61 Correct 22 ms 2780 KB Output is correct
62 Correct 37 ms 5052 KB Output is correct
63 Correct 36 ms 4816 KB Output is correct
64 Correct 37 ms 5048 KB Output is correct
65 Correct 37 ms 4812 KB Output is correct
66 Correct 37 ms 5040 KB Output is correct
67 Correct 37 ms 4896 KB Output is correct
68 Correct 38 ms 5048 KB Output is correct
69 Correct 37 ms 4828 KB Output is correct
70 Correct 44 ms 5268 KB Output is correct
71 Correct 36 ms 4812 KB Output is correct
72 Correct 40 ms 4812 KB Output is correct
73 Correct 36 ms 4816 KB Output is correct