Submission #74307369

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include<queue>
#include<set>

using namespace std;

void solve() {
    
    int n; cin >> n;
    int k; cin >> k;

    vector<int> a(n);

    for(int i = 0; i < n; i++){
        cin >> a[i];
        a[i] %= k;
    }

    sort(a.begin(), a.end());

    int mx = 0;

    for(int i = 1; i < n; i++){
        mx = max(mx, a[i] - a[i-1]);
    }

    cout << min(a[n-1] - a[0], k - mx) << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int tc = 1;
    // cin >> tc;
    while(tc--){
        solve();
    }
    return 0;
}

Submission Info

Judge Result