Submission #538936

#TimeUsernameProblemLanguageResultExecution timeMemory
538936thegrimbeeSelf Study (JOI22_ho_t2)C++14
10 / 100
113 ms11388 KiB
		#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(),comp);
		if (m == 1){
			cout << max(v[0].first, v[0].second);
		}
		
	}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...