| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 995855 | faqinyeager | Self Study (JOI22_ho_t2) | C++17 | 0 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
vector<pair<int, int>> a;
int main(){
cin >> n >> m;
a.resize(n);
for(int i = 0; i < n; i++) cin >> a[i].first;
for(int i = 0; i < n; i++) cin >> a[i].second;
sort(a.begin(), a.end());
int ans = a[n - 1].first;
for(auto x: a){
ans = min(ans, max(x.first, x.second));
}
cout << ans;
}| # | 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... | ||||
