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;
const int MAX_N = 3e5+7;
long long n,m,a[MAX_N],b[MAX_N];
int main(){
iostream::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 0;i < n;i++)
cin >> a[i];
for(int i = 0;i < n;i++)
cin >> b[i];
if(m == 1){
long long mi = 1000000000000;
for(int i = 0;i < n;i++){
mi = min(max(a[i],b[i]),mi);
}
cout << mi;
return 0;
}
return 0;
}
| # | 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... |