Submission #464696

#	Time	Username	Problem	Language	Result	Execution time	Memory
464696		Hamed5001	Cipele (COCI18_cipele)	C++14	27 / 90	43 ms	2632 KiB

cipele

#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();
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9