#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, t, ans = 1e9;
vector <int> a;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> t;
a.resize(n);
for (int& i : a) { cin >> i; i %= t; }
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
a.push_back(a[i] + t);
ans = min(ans, (a[i + n - 1] - a[i] + 1) / 2);
}
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... |