제출 #942044

#제출 시각아이디문제언어결과실행 시간메모리
942044IUA_HasinSelf Study (JOI22_ho_t2)C++17
10 / 100
191 ms13908 KiB
#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std;

int main ()
{   
    ll n, m;
    cin>>n>>m;

    ll arr[n];
    ll brr[n];

    for(int i=0; i<n; i++){
        cin>>arr[i];
    }

    for(int i=0; i<n; i++){
        cin>>brr[i];
    }

    ll crr[n];
    for(int i=0; i<n; i++){
        ll aaaa = max(arr[i], brr[i]);
        crr[i] = aaaa;
    }
    ll ans = crr[0];

    for(int i=0; i<n; i++){
        ans = min(crr[i], ans);
    }
    cout<<ans<<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...