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;
#define int long long
bool debug = false;
int mod = 1e9+7;
bool comp(pair<int, int> a, pair<int, int> b){
return max(a.first, a.second) < max(b.first, b.second);
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m; cin>> n>> m;
vector<pair<int, int>> v(n);
for (int i= 0; i < n; ++i){
cin >> v[i].first;
}
for (int i = 0; i < n; ++i){
cin >> v[i].second;
}
sort(v.begin(), v.end());
if (m == 1){
cout << max(v[0].first, v[0].second);
}
}
# | 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... |