#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;
}
#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 ; }
Comments
Post a Comment