Submission #538934

# Submission time Handle Problem Language Result Execution time Memory
538934 2022-03-18T04:58:51 Z thegrimbee Self Study (JOI22_ho_t2) C++14
0 / 100
1 ms 212 KB
	#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
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -