Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <climits>
- #include <stack>
- #include <string>
- #include <vector>
- #include <sstream>
- using namespace std;
- int main()
- {
- int totalNumbers, popNumbers, searchNumbers;
- cin >> totalNumbers >> popNumbers >> searchNumbers;
- stack<int> buffer;
- for(int i = 0; i < totalNumbers; i++)
- {
- int buf;
- cin >> buf;
- buffer.push(buf);
- }
- for(int i = 0; i < popNumbers; i++)
- buffer.pop();
- if(buffer.size() == 0)
- {
- cout << "0" << endl;
- return 0;
- }
- int smallest = INT_MAX;
- while(buffer.size())
- {
- int top = buffer.top();
- buffer.pop();
- if(top == searchNumbers)
- {
- cout << "true" << endl;
- return 0;
- }
- if(top < smallest)
- smallest = top;
- }
- cout << smallest << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement