#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, t, x, odp = 1000000007;
cin >> n >> t;
vector<int> pom, v;
for (int i = 0; i < n; i++)
cin >> x, pom.push_back(x%t), pom.push_back(x%t-t);
sort(pom.begin(),pom.end());
for (int i = 0; i < pom.size(); i++)
if (v.empty() || v.back() != pom[i])
v.push_back(pom[i]);
for (int i = 0; i < v.size()/2; i++)
odp = min(odp,(v[i+v.size()/2-1]-v[i]+1)/2);
cout << odp << endl;
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... |