제출 #1151011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151011		yamtllq	Cipele (COCI18_cipele)	C++20	18 / 90	58 ms	1096 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

int n, m, leftp[100001], rightp[100001], ans = 0;

int main(){
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> leftp[i];
	}
	for (int i = 1; i <= m; i++){
		cin >> rightp[i];
	}
	sort(leftp + 1, leftp + n + 1);
	sort(rightp + 1, rightp + n + 1);
	if (n == m){
		for (int i = 1; i < n; i++){
			ans = max(ans, abs(rightp[i] - leftp[i]));
		}
		cout << ans;
	}
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 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