设停车场是一个可以停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次有北向南排列（大门在最南端，最先到达的第一车停放在车场的最北端），若车场内已停满n辆车，那么后来的车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该辆车开出大门外，其他车辆再按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。

以栈模拟停车场，以队列模拟车场外的便道。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停车不收费）。栈以顺序存储结构实现，队列以链表结构实现。-Parking lots can be accommodated is a narrow channel of the n vehicles, and only one door available for car and out. Car in the parking lot, according to the order of the vehicle arrival time, turn north to south order (doors at the southernmost tip, the first to reach the first car parked in the yard of the North), if the car floor is full of parked n the car, then later cars can only wait on the sidewalk outside the door once the car drove off, then came in to open into the first car on the sidewalk　when a car in the parking lot to leave behind it into the vehicle must to exit the yard to make way for it to be the car to open outside the gate, other vehicles and then the original order to enter the yard, per parked in the yard when it left the parking lot, the vehicle must pay the cost of the length of time it stays. Test for the simulation program management of the parking lot prepared according to the above requirements.

Parking to stack simulation queue simulation car off the si