Submission #1329582

#TimeUsernameProblemLanguageResultExecution timeMemory
1329582Valters07Self Study (JOI22_ho_t2)C++20
10 / 100
43 ms2772 KiB
#include <bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define en exit(0);
using namespace std;
const int N = 3e5 + 5;
const int INF = 1e9 + 5;
int a[N], b[N];
int main()
{
    fio
//    ifstream cin("in.in");
    int n, m;
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
        cin >> a[i];
    for(int i = 1;i <= n;i++)
        cin >> b[i];
    int res = INF;
    for(int i = 1;i <= n;i++)
        res = min(res, max(a[i], b[i]));
    cout << res;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...