#include<bits/stdc++.h>
using namespace std;
void solveSubtask1(long long n){
long long a[n];
long long b[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < n; i++){
cin >> b[i];
}
long long ans = 1e18;
for(int i = 0; i < n; i++){
ans = min(ans, max(a[i], b[i]));
}
cout << ans << "\n";
}
int main(){
long long n, m;
cin >> n >> m;
if(m == 1){
//subtask 1
solveSubtask1(n);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
304 KB |
Output is correct |
10 |
Correct |
4 ms |
436 KB |
Output is correct |
11 |
Correct |
218 ms |
10712 KB |
Output is correct |
12 |
Correct |
218 ms |
10712 KB |
Output is correct |
13 |
Correct |
164 ms |
8780 KB |
Output is correct |
14 |
Correct |
153 ms |
8780 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
77 ms |
6220 KB |
Output is correct |
17 |
Correct |
233 ms |
11348 KB |
Output is correct |
18 |
Correct |
217 ms |
10732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
77 ms |
6220 KB |
Output is correct |
3 |
Correct |
233 ms |
11348 KB |
Output is correct |
4 |
Correct |
217 ms |
10732 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
304 KB |
Output is correct |
10 |
Correct |
4 ms |
436 KB |
Output is correct |
11 |
Correct |
218 ms |
10712 KB |
Output is correct |
12 |
Correct |
218 ms |
10712 KB |
Output is correct |
13 |
Correct |
164 ms |
8780 KB |
Output is correct |
14 |
Correct |
153 ms |
8780 KB |
Output is correct |
15 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
304 KB |
Output is correct |
10 |
Correct |
4 ms |
436 KB |
Output is correct |
11 |
Correct |
218 ms |
10712 KB |
Output is correct |
12 |
Correct |
218 ms |
10712 KB |
Output is correct |
13 |
Correct |
164 ms |
8780 KB |
Output is correct |
14 |
Correct |
153 ms |
8780 KB |
Output is correct |
15 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |