停车场是一条可以停放n辆车的狭窄通道，且只有一个大门汽车停放安到达时间的先后依次由北向南排列（大门在最南端，最先到达的第一辆车停在最北端）若停车场已经停满n辆车，后来的汽车在便道上等候，一旦有车开走，排在便道上的第一辆车可以开入；当停车场的某辆车要离开时，停在他后面的车要先后退为他让路，等它开出后其他车在按照原次序开入车场，每两停在车场的车要安时间长短缴费。

要求：以栈模拟停车场，以队列车场外的便道，按照从终端输入的数据序列进行模拟管理。每一组数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码、以及到达或离去的时刻。对每一组数据进行操作后的信息为：若是车辆到达，则输出汽车在停车场的内或便道上的位置：若是车辆离去则输出汽车在停车场内的停留时间和应缴纳的费用（在便道上的停留时间不收费）。栈以顺序结构实现，队列以链表结构实现。

-parking can be a n vehicles parked in a narrow channel. and only one door car parked on the time of arrival has followed from north to south with (the southernmost tip of the door, the first to reach No. 1 car was parked in the most northern end of the project) if the car park has been full of parked cars n, and later in the car on the sidewalk waiting Once a car drive away, on the sidewalk on the first one into the car; When parking a car to leave, He stopped at the first car behind the back of his crazy, it has come out after the other vehicles in the original order into the garage, Every two parked cars in the parking lots to pay security duration. Requirements : Stack simulated car parks, to train teams outside the sidewalk, according to the input from the terminal sequence simulation