#include <iostream>
#include <queue>
using namespace std;
struct Node {
char data;
Node* next;
Node(char c, struct Node* nptr = nullptr)
: data(c), next(nptr) {}
};
template <class T>
struct NodeCmp {
bool operator()(const T& lhs, const T& rhs) const {
return lhs->data > rhs->data;
}
};
int main() {
priority_queue<Node*, vector<Node*>, NodeCmp<Node*>> PQ;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8cXVldWU+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgpzdHJ1Y3QgTm9kZSB7CiAgICBjaGFyICBkYXRhOwogICAgTm9kZSogbmV4dDsKICAgIE5vZGUoY2hhciBjLCBzdHJ1Y3QgTm9kZSogbnB0ciA9IG51bGxwdHIpCiAgICAgICAgOiBkYXRhKGMpLCBuZXh0KG5wdHIpIHt9Cn07Cgp0ZW1wbGF0ZSA8Y2xhc3MgVD4Kc3RydWN0IE5vZGVDbXAgewogICAgYm9vbCBvcGVyYXRvcigpKGNvbnN0IFQmIGxocywgY29uc3QgVCYgcmhzKSBjb25zdCB7CiAgICAgICAgcmV0dXJuIGxocy0+ZGF0YSA+IHJocy0+ZGF0YTsKICAgIH0KfTsKCmludCBtYWluKCkgewogICAgcHJpb3JpdHlfcXVldWU8Tm9kZSosIHZlY3RvcjxOb2RlKj4sIE5vZGVDbXA8Tm9kZSo+PiBQUTsKCiAgICByZXR1cm4gMDsKfQo=