利用书中图5.19和图5.20的最大值堆实现一个优先队列。对于队列的操作应该支持下列几种指令： void enqueue[int ObjectID, int Priority] int dequeue[] void changeweight[int ObjectID, int newPriority] 函数enqueue向优先队列中插入一个ID号为ObjectID、优先级为Priority的新对象。函数dequeue从优先队列中删除优先级最高的对象，并返回该对象的

Pretty cool 3D lower level AI simulator. There is a food chain. The low creatures eat the stationary food, the high creatures eat the low creatures. Once a pair mates , the mother carries eggs with her for a while. Once a counter is reached, the egg