First negative integer in every window of size K.

#include<bits/stdc++.h>
using namespace std;

int print(queue<int>q)
{

while(!q.empty())
{
  if(q.front()<0)
  {
    return q.front();
  }
  q.pop();
}
return 0;

}

void printans(vector<int>ans)
{
for(int i=0 ; i<ans.size() ; i++)
{
cout<<ans[i]<<" ";
}
}

int main()
{
int arr[8]={2,-3,-4,-2,7,8,9,-10};
int n=8;
vector<int>ans;
queue<int>q;
int k;
cin>>k;

for(int i=0 ; i<k-1 ; i++)
{
q.push(arr[i]);
}
for(int i=k-1 ; i<n ; i++)
{
q.push(arr[i]);
ans.push_back(print(q));
q.pop();
}

printans(ans);
return 0;
}**********