oj.uz

답안 #433476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433476 2021-06-19T21:07:33 Z MilosMilutinovic Exhibition (JOI19_ho_t2) C++14
100 / 100
 180 ms 4496 KB 
#include <bits/stdc++.h>
#define MAXN 100007
using namespace std;
pair<int,int> a[MAXN];
int b[MAXN];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i].second>>a[i].first;
    for(int i=0;i<m;i++) cin>>b[i];
    sort(a,a+n);
    sort(b,b+m);
    int x=n-1,y=m-1,ans=0;
    while(x>=0 && y>=0)
    {
        if(b[y]>=a[x].second)
        {
            y--;
            ans++;
        }
        x--;
    }
    cout<<ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 308 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 3 ms 312 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 2 ms 312 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 157 ms 4404 KB Output is correct
39 Correct 156 ms 4344 KB Output is correct
40 Correct 146 ms 4356 KB Output is correct
41 Correct 155 ms 4316 KB Output is correct
42 Correct 162 ms 4496 KB Output is correct
43 Correct 180 ms 4252 KB Output is correct
44 Correct 152 ms 4352 KB Output is correct
45 Correct 148 ms 4296 KB Output is correct
46 Correct 150 ms 4292 KB Output is correct
47 Correct 136 ms 3908 KB Output is correct
48 Correct 137 ms 3920 KB Output is correct
49 Correct 121 ms 3524 KB Output is correct
50 Correct 124 ms 3624 KB Output is correct
51 Correct 149 ms 4288 KB Output is correct
52 Correct 176 ms 4296 KB Output is correct
53 Correct 147 ms 4268 KB Output is correct
54 Correct 152 ms 4292 KB Output is correct
55 Correct 152 ms 4356 KB Output is correct
56 Correct 104 ms 2900 KB Output is correct
57 Correct 54 ms 1560 KB Output is correct
58 Correct 98 ms 2936 KB Output is correct
59 Correct 98 ms 2936 KB Output is correct
60 Correct 53 ms 1604 KB Output is correct
61 Correct 90 ms 2496 KB Output is correct
62 Correct 149 ms 4236 KB Output is correct
63 Correct 180 ms 4348 KB Output is correct
64 Correct 161 ms 4276 KB Output is correct
65 Correct 150 ms 4264 KB Output is correct
66 Correct 152 ms 4352 KB Output is correct
67 Correct 176 ms 4276 KB Output is correct
68 Correct 150 ms 4292 KB Output is correct
69 Correct 152 ms 4308 KB Output is correct
70 Correct 152 ms 4356 KB Output is correct
71 Correct 176 ms 4292 KB Output is correct
72 Correct 154 ms 4420 KB Output is correct
73 Correct 146 ms 4352 KB Output is correct