#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
int32_t main() {
fast
int n, t;
cin >> n >> t;
deque <int> arr(n);
for(int i = 0; i < n; i++) {
cin >> arr[i];
arr[i] %= t;
}
sort(arr.begin(), arr.end());
int ans = inf;
for(int i = 0; i < n; i++) {
ans = min(ans, (arr.back() - arr[0] + 1) / 2);
arr.push_back(arr[0] + t);
arr.pop_front();
}
cout << ans;
}
# | 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... |