Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <algorithm>
- using namespace std;
- ifstream cin("interval1.in");
- ofstream cout("interval1.out");
- int n,k,a[1001];
- int main()
- {
- cin>>n>>k;
- for(int i=1;i<=n;++i)
- cin>>a[i];
- sort(a+1,a+n+1);
- int j,p,ini,fin,nr,mi=2002;
- for(int i=1;i<=n;++i)
- {
- nr=1;
- for(j=i+1;j<=n;++j)
- if(nr<=k)
- ++nr;
- else
- break;
- --j;
- p=j;
- while(a[p+1]==a[j]&&p<=n)
- ++nr,++p;
- p--;
- if((a[p]-a[i])<mi&&nr>=k)
- mi=a[p]-a[i],ini=a[i],fin=a[p];
- }
- cout<<ini<<' '<<fin;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement