This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |