priority queue c++ 사용 법

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;
	}
};

struct compMin {
	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<Sample, vector<Sample>, compMax> pqMax[MAX_TRAIN];
priority_queue<Sample, vector<Sample>, compMin> pqMin[MAX_TRAIN];

for (int i = 0; i < N ; i++) {

	pqMax[i] = priority_queue<Sample, vector<Sample>, compMax>();
	pqMin[i] = priority_queue<Sample, vector<Sample>, compMin>();
}