Submission #922740

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922740	2024-02-06T05:12:03 Z	SuPythony	Self Study (JOI22_ho_t2)	C++17	10 / 100	176 ms	11512 KB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n,m; cin>>n>>m;
    vector<ll> a(n), b(n);
    for (auto &i: a) cin>>i;
    for (auto &i: b) cin>>i;
    ll ans=1e18;
    for (int i=0; i<n; i++) {
        ans=min(ans,max(a[i],b[i]));
    }
    cout<<ans;
    return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	436 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	166 ms	10744 KB	Output is correct
12	Correct	163 ms	10740 KB	Output is correct
13	Correct	133 ms	8692 KB	Output is correct
14	Correct	120 ms	8704 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	64 ms	6228 KB	Output is correct
17	Correct	176 ms	11512 KB	Output is correct
18	Correct	163 ms	10832 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	64 ms	6228 KB	Output is correct
3	Correct	176 ms	11512 KB	Output is correct
4	Correct	163 ms	10832 KB	Output is correct
5	Incorrect	0 ms	600 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	436 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	166 ms	10744 KB	Output is correct
12	Correct	163 ms	10740 KB	Output is correct
13	Correct	133 ms	8692 KB	Output is correct
14	Correct	120 ms	8704 KB	Output is correct
15	Incorrect	0 ms	600 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

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

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	436 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	166 ms	10744 KB	Output is correct
12	Correct	163 ms	10740 KB	Output is correct
13	Correct	133 ms	8692 KB	Output is correct
14	Correct	120 ms	8704 KB	Output is correct
15	Incorrect	0 ms	600 KB	Output isn't correct
16	Halted	0 ms	0 KB	-