Why i m getting WA in codeforces round 637 DIV-2 B?

Solution :

#include <bits/stdc++.h>
#include
#include
#define ll long long

using namespace std;

int main()
{
int tc,n,a,k;

cin>>tc;

while(tc--)
{
    cin>>n>>k;

    int arr[n];

    for(int i=0;i<n;i++)
        cin>>arr[i];

    queue<int> peaks;
    int start=0;
    int end=k-1;
    int maxPeaks=0;
    int left=1;

    for(int i=1;i<end;i++)
    {
        if(arr[i]>arr[i+1] && arr[i]>arr[i-1])
            peaks.push(i);
    }

    maxPeaks=peaks.size();

    while(end<n-1)
    {
        start++;
        if(peaks.front()==start)
            peaks.pop();

        if(arr[end]>arr[end+1] && arr[end]>arr[end-1])
            peaks.push(end);

        if(maxPeaks<(int)peaks.size())
        {
            maxPeaks=peaks.size();
            left=start+1;
        }

        end++;
        
    }

    cout<<maxPeaks+1<<" "<<left<<endl;

    }

}