Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Codeforces Round 337A
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main()
- {
- int n, m, mm[51];
- cin >> n >> m;
- for(int i=0; i<m; i++)
- {
- cin >> mm[i];
- }
- sort(mm, mm + m);
- int z, minim=100001;
- z =(m - n)+1;
- for(int i=0; i<z; i++)
- {
- if((mm[i+n-1]-mm[i])<minim)
- {
- minim =mm[i+n-1]-mm[i];
- }
- }
- cout << minim;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement