Submission #464696

# Submission time Handle Problem Language Result Execution time Memory
464696 2021-08-13T17:20:36 Z Hamed5001 Cipele (COCI18_cipele) C++14
27 / 90
43 ms 2632 KB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
/*
	dp[i] = min ugliness if I paired first i shoes
	dp[i] = 
*/
void solve() {
	int N, M;
	cin >> N >> M;
	vector<int> A1(N), A2(M);
	for (auto& a : A1) cin >> a;
	for (auto& a : A2) cin >> a;
	sort(A1.begin(), A1.end());
	sort(A2.begin(), A2.end());
	int ans = 0;
	for (int i = 0; i < N; i++) {
		ans = max(ans, abs(A1[i]-A2[i]));
	}
	cout << ans;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}
# Verdict Execution time Memory Grader output
1 Correct 27 ms 2376 KB Output is correct
2 Correct 42 ms 2632 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 42 ms 2576 KB Output is correct
2 Correct 43 ms 2560 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 2152 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 2340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 2060 KB Output isn't correct
2 Halted 0 ms 0 KB -