以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现。队列以链表结构实现-Stack simulation parking lot to the queue simulation car off the sidewalk, in accordance with the read from the terminal into the input data sequence to simulate management. Each set of input data including the three data items: car "arrived" or "leave" information, vehicle license number and the arrival or departure time. A set of input data to the output after the operation as follows: if the vehicle arrives at the output of the position of car parking in the parking lot or sidewalk　if the vehicle to leave, then the output of cars in the parking lot of time to stay and should pay costs (stay on the sidewalk free of charge). Stack in the order of the structure. Queue to the list structure to achieve