如何在C++中对priority_queue中的对象进行排序？

struct Person {
    string name;
    int age;
};

struct ComparePerson {
    bool operator()(const Person& p1, const Person& p2) {
        return p1.age > p2.age; // 按照年龄从小到大排序
    }
};

int main() {
    priority_queue<Person, vector<Person>, ComparePerson> pq;
    // 向priority_queue中插入Person对象
    pq.push({"Alice", 25});
    pq.push({"Bob", 30});
    pq.push({"Charlie", 20});

    // 依次取出并输出排序后的Person对象
    while (!pq.empty()) {
        Person p = pq.top();
        pq.pop();
        cout << "Name: " << p.name << ", Age: " << p.age << endl;
    }

    return 0;
}

struct Person {
    string name;
    int age;

    bool operator<(const Person& other) const {
        return age > other.age; // 按照年龄从小到大排序
    }
};

int main() {
    priority_queue<Person> pq;
    // 向priority_queue中插入Person对象
    pq.push({"Alice", 25});
    pq.push({"Bob", 30});
    pq.push({"Charlie", 20});

    // 依次取出并输出排序后的Person对象
    while (!pq.empty()) {
        Person p = pq.top();
        pq.pop();
        cout << "Name: " << p.name << ", Age: " << p.age << endl;
    }

    return 0;
}