| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358058 | SulA | Self Study (JOI22_ho_t2) | C++20 | 118 ms | 2752 KiB |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
int main() {
int n,m; cin >> n >> m;
int A[n], B[n];
for (int i = 0; i < n; cin >> A[i++]);
for (int i = 0; i < n; cin >> B[i++]);
int ans = max(A[0], B[0]);
for (int i = 0; i < n; i++)
ans = min(ans, max(A[i], B[i]));
cout << ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
