Hostel Visit TLE in the code

#1

time limit exceeded can you just send me the test case as I want to test it myself and also a suggestion in my code to improve TLE
https://codeshare.io/5wVWxK

#2

Hello @sanyamsri2001
Your code below takes O(k) time
for( long long int i=0;i<k-1;i++) deletepeek();

if we have 10^4 queries of type 2, then this will run 10^4k times. Here k can be 10^5
so 10^410^5 = 10^9 operations.
while max number of operations that a computer can perform in 1s is 10^8.
Hence TLE.