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

Gcd using recursion

#include<iostream> #include<algorithm> using namespace std; int gcd(int m,int n) {     if(max(m,n)%min(m,n)==0)     {         return min(m,n);     }     else     {         gcd(max(m,n)%min(m,n),min(m,n));     } } int main() {     int m,n;     cin>>m>>n;     cout<<gcd(m,n);     return 0; }
Post a Comment
Read more

Bubble Sort Algorithm

//bubble sort algorithm in c++ #include<bits/stdc++.h> using namespace std; void bubble_sort(int arr[],int n) {     int i,j;     for(i=1;i<n;i++)     {         for(j=0;j<n-i;j++)         {             if(arr[j]>arr[j+1])             {                 swap(arr[j],arr[j+1]); //swap is an inbuilt function             }         }     }     //time complexity is O(n^2) } int main() {     int n,i;     cout<<"Enter the number of elements of the array"<<endl;     cin>>n;     int arr[n];     for(i=0;i<n;i++)     { ...
Post a Comment
Read more

Counting the number of strongly connected sub graph

#include<bits/stdc++.h> using namespace std; class graph {     int v;     list<int> *adj; public:     graph(int v)     {         this->v=v;         adj=new list<int>[v];     }     void add_edge(int v,int w)     {         adj[v].push_back(w);         adj[w].push_back(v);     }     void dfs(int start,bool visited[]);     void counted(int start); }; void graph:: dfs(int start,bool visited[]) {     visited[start]=true;     for(auto it=adj[start].begin();it!=adj[start].end();it++)     {         if(!visited[*it])         {             dfs(*it,visited);  ...
Post a Comment
Read more