#include<iostream>
#include<queue>
#include<stack>
#include<vector>
using namespace std;

bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
    int popi = 0;
    int pushi = 0;
    stack<int>stpush;
    while (pushi < pushed.size())
    {
        stpush.push(pushed[pushi++]);
        while (!stpush.empty() && stpush.top() == popped[popi])
        {
            ++popi;
        }
    }
    if (popi == popped.size())
    {
        return true;
    }
    return false;

}

bool canPartition(vector<int>& nums) {
    int sum = 0;
    for (int i = 0; i < nums.size(); ++i)
    {
        sum += nums[i];
    }
    int k = sum / 2;
    for (int i = 0; i < nums.size(); ++i)
    {

    }


}


int main()
{
    vector<int>pushed = { 1,2,8,5,5 };

    


    return 0;
}