#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
int main()
{
ll n, T;
cin >> n >> T;
ll a[2 * n + 5];
for (ll i = 1; i <= n; i++)
cin >> a[i], a[i] = a[i] % T;
sort(a + 1, a + n + 1);
ll ans = T;
for (ll i = 1; i <= n; i++)
{
ans = min(ans, (a[i + n - 1] - a[i] + 1) / 2);
a[i + n] = a[i] + T;
}
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... |