Submission #891648

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891648	2023-12-23T13:28:01 Z	12345678	Self Study (JOI22_ho_t2)	C++17	10 / 100	47 ms	9044 KB

Main

#include <bits/stdc++.h>

using namespace std;

const int nx=3e5+5;
int n, m, a[nx], b[nx], res=INT_MAX;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i], res=min(res, max(a[i], b[i]));
    cout<<res;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	46 ms	8532 KB	Output is correct
12	Correct	45 ms	8528 KB	Output is correct
13	Correct	36 ms	6500 KB	Output is correct
14	Correct	40 ms	6760 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	26 ms	3932 KB	Output is correct
17	Correct	47 ms	9044 KB	Output is correct
18	Correct	46 ms	8508 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	26 ms	3932 KB	Output is correct
3	Correct	47 ms	9044 KB	Output is correct
4	Correct	46 ms	8508 KB	Output is correct
5	Incorrect	1 ms	2396 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	46 ms	8532 KB	Output is correct
12	Correct	45 ms	8528 KB	Output is correct
13	Correct	36 ms	6500 KB	Output is correct
14	Correct	40 ms	6760 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2396 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	46 ms	8532 KB	Output is correct
12	Correct	45 ms	8528 KB	Output is correct
13	Correct	36 ms	6500 KB	Output is correct
14	Correct	40 ms	6760 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-