Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<vector>
- #include<algorithm>
- #include<climits>
- using namespace std;
- int perfectDist(vector<int> &v, int students){
- sort(v.begin(), v.end());
- int res = INT_MAX;
- for(int i = 0, j = students - 1; j < (int) v.size(); i++, j++){
- res = min(res, v[j] - v[i]);
- }
- return res;
- }
- int main()
- {
- int n;
- cin >> n;
- vector<int> v(n);
- for(int i = 0; i < n; i++)
- cin >> v[i];
- int students;
- cin >> students;
- cout << perfectDist(v, students) << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
