#include <bits/stdc++.h>
#define ar array
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const int N = 1e5 + 5;
signed main() {
int n, t; cin >> n >> t;
vector<int> a(n+1);
for(int i=1; i<=n; i++) cin >> a[i], a[i] %= t;
sort(a.begin()+1, a.end());
int ans = 1e9;
multiset<int> st;
for(int i=1; i<=n; i++) st.insert(a[i]);
ans = *st.rbegin() - *st.begin();
for(int i=n; i>=1; i--) {
st.erase( st.find(a[i]) );
st.insert(a[i]-t);
ans = min(ans, *st.rbegin() - *st.begin());
}
cout << (ans + 1) / 2 << endl;
}
# | 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... |