设计合理的数据组织方式，设计算法实现停车管理系统，实现车辆的进入、离开并根据停车时间计费，给出c++写的完整代码

好的，以下是一个停车管理系统的C++实现，包括车辆进入、离开和计费等功能。

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <ctime>

using namespace std;

// 停车场中的车辆信息
struct Car {
    string license_plate; // 车牌号
    time_t enter_time; // 进入时间
    time_t exit_time; // 离开时间
};

// 可用车位信息
struct ParkingSpot {
    int spot_id; // 车位编号
    string spot_type; // 车位类型
};

class ParkingLot {
public:
    ParkingLot(int num_small_spots, int num_large_spots) {
        // 初始化可用车位列表
        for (int i = 0; i < num_small_spots; ++i) {
            small_spots.push_back({i, "small"});
        }
        for (int i = 0; i < num_large_spots; ++i) {
            large_spots.push_back({i, "large"});
        }
    }

    void park(string license_plate) {
        // 分配一个可用车位
        ParkingSpot spot;
        if (!small_spots.empty()) {
            spot = small_spots.front();
            small_spots.pop();
        } else if (!large_spots.empty()) {
            spot = large_spots.front();
            large_spots.pop();
        } else {
            cout << "No parking spots available" << endl;
            return;
        }

        // 添加车辆信息到停车场列表中
        Car car = {license_plate, time(NULL), 0};
        cars.push_back({car, spot});

        cout << "Car " << license_plate << " parked at spot " << spot.spot_id << endl;
    }

    void unpark(string license_plate) {
        for (int i = 0; i < cars.size(); ++i) {
            Car& car = cars[i].first;
            if (car.license_plate == license_plate) {
                // 计算停车时间和停车费用
                car.exit_time = time(NULL);
                double duration = difftime(car.exit_time, car.enter_time);
                double fee = calculate_fee(duration, cars[i].second.spot_type);

                // 释放车位并从停车场列表中删除车辆信息
                ParkingSpot spot = cars[i].second;
                if (spot.spot_type == "small") {
                    small_spots.push(spot);
                } else if (spot.spot_type == "large") {
                    large_spots.push(spot);
                } else {
                    cout << "Invalid parking spot type" << endl;
                    return;
                }
                cars.erase(cars.begin() + i);

                cout << "Car " << license_plate << " unparked from spot " << spot.spot_id << endl;
                cout << "Parking fee: " << fee << endl;
                return;
            }
        }
        cout << "Car " << license_plate << " not found in parking lot" << endl;
    }

private:
    vector<pair<Car, ParkingSpot>> cars; // 停车场中的车辆列表
    queue<ParkingSpot> small_spots; // 可用小车位列表
    queue<ParkingSpot> large_spots; // 可用大车位列表

    double calculate_fee(double duration, string spot_type) {
        // TODO: 实现停车费用计算函数，根据停车时间和车位类型计算停车费用
        return 0.0;
    }
};

int main() {
    ParkingLot parking_lot(10, 5); // 初始化10个小车位和5个大车位的停车场

    parking_lot.park("京A12345");
    parking_lot.park("京B67890");
    parking_lot.unpark("京A12345");
    parking_lot.park("京C24680");
    parking_lot.unpark("京B67890");

    return 0;
}

这个实现使用了C++的STL库中的vector和queue等容器来存储车辆信息和可用车位信息。还需要根据具体需求实现停车费用计算函数。