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>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = 3e5 ;
ll n, m, l = 0, r = 1e18, a[N + 1], b[N + 1] ;
signed main()
{
ios_base::sync_with_stdio( 0 ) ;
cin.tie( 0 ) ;
cout.tie( 0 ) ;
cin >> n >> m ;
for(ll i = 1 ; i <= n ; i++)
cin >> a[i] ;
for(ll i = 1 ; i <= n ; i++)
cin >> b[i] ;
if(m == 1)
{
ll mn = 1e18 ;
for(int i = 1 ; i <= n ; i++)
mn = min(mn, max(a[i], b[i])) ;
cout << mn << '\n' ;
return 0 ;
}
// while(l + 1 < r)
// {
// ll mid = (l + r) >> 1 ;
// for(int i = 1 ; i <= n ; i++)
// if(a[i] > b[i])
// {
// }
// else
// {
// }
// if(flag)
// r = mid ;
// else
// l = mid ;
// }
// cout << l ;
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... |