.insert dekh lo bas baaki itna easy hai STL makes life easy :D
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<int> lastVisitedIntegers(vector<int>& nums) {\n        vector<int>seen;\n        vector<int>ans;\n        int k=0;\n        for(int i=0;i<nums.size();i++)\n        {\n            if(nums[i]>0)\n            {   \n                seen.insert(seen.begin(),nums[i]);\n                k=0;\n            }\n            else if(nums[i]==-1)\n            {\n                k++;\n                if(k>seen.size())\n                {\n                    ans.push_back(-1);\n                }\n                else\n                {\n                    ans.push_back(seen[k-1]);\n                }\n            }\n        }\n        return ans;   \n    }\n};\n```
['C++']