Contest Name - Code-o-Fiesta
Problem Code: COFDQ1
Question link - https://www.codechef.com/COFDEC20/problems/COFDQ1/
#include<bits/stdc++.h>
#define int long long
using namespace std;
void fun(vector<int> &v,int k)
{
for(int i=0;i<v.size()-k+1;i++)
{
vector<int> v1;
for(int j=i;j<k+i;j++)
{
v1.push_back(v[j]);
}
sort(v1.begin(),v1.end());
if(i==v.size()-k)
{
if(k%2==0)
{
int sum = v1[k/2]+v1[k/2-1];
cout<<(float)sum/2;
}
else
cout<<v1[k/2];
}
else
{
if(k%2==0)
{
int sum = v1[k/2]+v1[k/2-1];
cout<<(float)sum/2<<" ";
}
else
cout<<v1[k/2]<<" ";
}
}
cout<<endl;
return;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int m;
cin>>m;
vector<int> v(m);
for(int i=0;i<m;i++)
cin>>v[i];
int k;
cin>>k;
fun(v,k);
return 0;
}