02. Queue Basic Operators

#include <iostream>
#include <climits>
#include <queue>
#include <string>
#include <vector>
#include <sstream>
using namespace std;

int main()
{
int totalNumbers, removeNumbers, searchNumbers;
  cin >> totalNumbers >> removeNumbers >> searchNumbers;

  queue<int> buffer;
  for(int i = 0; i < totalNumbers; i++)
    {
      int buf;
      cin >> buf;
      buffer.push(buf);
    }
   for(int i = 0; i < removeNumbers; i++)
     buffer.pop();

   if(buffer.size() == 0)
   {
     cout << "0" << endl;
     return 0;
   }

  int smallest = INT_MAX;

  while(buffer.size())
    {
      int current = buffer.front();
      buffer.pop();

      if(current == searchNumbers)
      {
        cout << "true" << endl;
        return 0;
      }

      if(current < smallest)
        smallest = current;
    }
  cout << smallest << endl;
  return 0;
}