说明：  设停车场是一个可停放n辆车的狭长通道，且只有一个大门可供汽车进出。在停车场内，汽车按到达的先后次序，由北向南依次排列（假设大门在最南端）。若车场内已停满n辆车，则后来的汽车需在门外的便道上等候，当有车开走时，便道上的第一辆车即可开入。当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该辆车开出大门后，其它车辆再按原次序返回车场。每辆车离开停车场时，应按其停留时间的长短交费（在便道上停留的时间不收费）。 1.主要数据结构 struct Car { // 车结构体 char ID[16]; //车牌号 int hour, min; // 进入时间 (小时:分钟) };
(The parking lot is a long and narrow passage for n vehicles, and there is only one gate for vehicles to enter and exit. In the parking lot, cars are arranged from north to south in the order of arrival (assuming the gate is at the southernmost end). If the parking lot is full of N cars, the later cars need to wait on the sidewalk outside the door. When there is a car driving away, the first car on the sidewalk can drive in. When a vehicle in the parking lot wants to leave, the vehicle that enters after it must first exit the parking lot to make way for it. After the vehicle leaves the gate, other vehicles will return to the parking lot in the original order. When each vehicle leaves the parking lot, it shall pay according to the length of its stay time (there is no charge for the stay time on the access road).)