设停车场是一个可停放n辆汽车的下狭长通道，且只有一个大门可供汽车进出，汽车在停车场内按车辆到达的时间先后排序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车厂的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该车开出大门外，其他车辆再按照原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制上述要求的管理模拟程序。(It simulates the parking lot by the stack, simulates the road outside the yard by the queue and simulates it according to the data sequence input from the terminal. Each set of input data includes three data items: the car "reach" or "leave" information, the license number of the car, and the arrival or departure time. The output information on the operation of each set of input data after: if the vehicle arrives, enter the parking position of motor vehicles in the parking lot or sidewalk; if the vehicle arrives, the output of motor vehicles in the parking lot or parking spaces on the sidewalk, if the vehicle left, then the output in the car in the parking lot to stay time and should be pay the costs (no fee stay on the sidewalk). The stack is implemented in a sequential structure, and the queue is implemented by a linked list structure.)