| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333273 | wstcube | Self Study (JOI22_ho_t2) | C++20 | 193 ms | 2756 KiB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
const int N = 2e5+5;
int main(){
int n;
cin >> n;
int m;
cin >> m;
vector<pair<int,int>> idk(n);
for(int i=0;i<n;i++){
cin >> idk[i].fi;
}
int ans=1e9+67;
for(int i=0;i<n;i++){
cin >> idk[i].se;
ans = min(ans,max(idk[i].fi,idk[i].se));
}
cout << ans;
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... | ||||
