| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1195539 | jesusarg | Self Study (JOI22_ho_t2) | C++20 | 218 ms | 5312 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<ll> a(n), b(n);
for(int i = 0; i < n; i++){cin >> a[i];}
for(int i = 0; i < n; i++){cin >> b[i];}
if(m == 1){
ll ans=LLONG_MAX;
for(int i = 0; i < n; i++){
ans=min(ans,max(a[i],b[i]));
}
cout<<ans<< "\n";
return 0;
}
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... | ||||
