Submission #1333254

#TimeUsernameProblemLanguageResultExecution timeMemory
1333254mtilordSelf Study (JOI22_ho_t2)C++20
10 / 100
59 ms3952 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    int mas[n][2];
    int atb[n]={};
    for(int i=0; i<n; i++)
    {
        cin >> mas[i][0];
        atb[i]=mas[i][0];
    }

    for(int i=0; i<n; i++)
    {
        cin >> mas[i][1];
        atb[i]=max(mas[i][1], atb[i]);
    }
    sort(atb, atb+n);
    cout << atb[0] << endl;




    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...