Skip to main content

codeforces-puzzles solution 

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
 int n,m;
 cin>>n>>m;
 vector<int> vect;
 map<int,int> mp;
 for(int i=0;i<m;i++)
 {
  int x;
  cin>>x;
  mp[x]++;
  vect.push_back(x);
 }
 sort(vect.begin(),vect.end());
 int small=vect[n-1]-vect[0];
 for(int i=0;i<vect.size()-n+1;i++)
 {
  int d=vect[i+n-1]-vect[i];
  if(small>d)
   small=d;
 }
 int flag=1;
 for(auto k:mp)
 {
  if(k.second>=n)
  {
   cout<<"0";
   flag=0;
   break;
  }
 }
 if(flag==1)
 {
  cout<<small;
 }
 return 0;
}

Comments

Post a Comment

Popular posts from this blog

Codeforces-Dubstep solution

#include < bits / stdc ++. h > using namespace std ; int main () { string str ; getline ( cin , str ); int index = str . find ( "WUB" ); int count = 0 ; while ( index !=- 1 ) { str . replace ( index , 3 , " " ); //str.erase(str.begin()+index,str.begin()+index+3); index = str . find ( "WUB" ); } cout << str ; return 0 ; }
Post a Comment
Read more

Jee Main Experience

April 8th, the day for which I worked hard for 3 years finally came. I woke up early and revised chemistry for 2 hrs and solved 2–3 math problems. That's all I have done in the morning. I reached the exam centre. It was already filled with many students and anxious parents. Some students were calm. I found one guy still solving his coaching material. I was shocked. I tried to calm myself. I went into the hall. I sat in my place. I spent an hour and half sitting idle. Now the real story begins. The omr and the paper were supposed to be given at 9:15. We didn't get. 9:20 still we didn't get. 9:25 we got. Ok I started filling the details. All those formalities were done by 9:50. I'm not joking. This was the exact time. By then I thought I'm done for nothing. I started math. I solved the first question. I got it. It gave me some confidence. I started doing the other questions. They were lengthy. I started feeling uncomfortable. I randomly switched to ph...
Post a Comment
Read more

codeforces-Anton and Danik

#include < bits / stdc ++. h > using namespace std ; int main () { long n ; string str ; cin >> n ; cin >> str ; long count = 0 , index ; index = str . find ( "A" ); while ( index !=- 1 ) { count ++; str . erase ( str . begin ()+ index , str . begin ()+ index + 1 ); index = str . find ( "A" ); } if ( count > n - count ) cout << "Anton" ; else if ( count < n - count ) cout << "Danik" ; else cout << "Friendship" ; return 0 ; }
Post a Comment
Read more