제출 #842131

#제출 시각아이디문제언어결과실행 시간메모리
842131vjudge1Self Study (JOI22_ho_t2)C++17
10 / 100
47 ms11536 KiB
#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 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...