#include <bits/stdc++.h>
using namespace std;
const int N = 500005, oo = 1e9;
int n, T, a[N];
signed main(void) {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> T;
for (int i = n + 1; i <= n * 2; i++) {
cin >> a[i];
a[i] %= T;
}
sort(a + n + 1, a + n * 2 + 1);
for (int i = 1; i <= n; i++) {
a[i] = a[i + n] - T;
}
int ans = oo;
for (int i = 1; i <= n + 1; i++) {
ans = min(ans, (a[i + n - 1] - a[i] + 1) >> 1);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |