#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;
const int N=5e5+5, mod = 1e9+7, inf = 1e18;
int n, t;
int a[N];
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> t;
for (int i=1; i<=n; i++) {
cin >> a[i];
a[i]%=t;
}
sort(a+1, a+n+1);
int ans = (a[n]-a[1])/2+(a[n]-a[1])%2;
for (int i=2; i<=n; i++) ans = min(ans, (a[i-1]-(a[i]-t))/2+(a[i-1]-(a[i]-t))%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... |