너와나의 관심사

struct Sample { int id, tid, point; } p_info[MAX_N]; struct compMax { bool operator()(Sample a, Sample b) { if (a.point == b.point) { return a.id > b.id; } return a.point b.point); } }; //pq declear priority_queue pqMax[MAX_TRAIN]; priority_queue pqMin[MAX_TR..