Submission #244116

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <functional>
#include <cstdio>

using namespace std;

typedef pair<int, int> P;

int main() {
	int n;
	cin >> n;
	priority_queue<P, vector<P>, greater<P> > pq;
	P p;
	char c;
	for (int i = 0; i < n; i++) {
		cin >> p.first >> c >> p.second;
		if (p.first % 10 >= 5) {
			p.first /= 10;
			p.first *= 10;
			p.first += 5;
		} else {
			p.first /= 10;
			p.first *= 10;
		}
		if (p.second % 10 == 0) {
		} else if (p.second % 10 <= 5) {
			p.second /= 10;
			p.second *= 10;
			p.second += 5;
		} else {
			p.second /= 10;
			p.second *= 10;
			p.second += 10;
			if (p.second % 100 == 60) {
				p.second /= 100;
				p.second++;
				p.second *= 100;
			}
		}
		pq.push(p);
	}
	queue<P> q;
	while (!pq.empty()) {
		P pp = pq.top();
		pq.pop();
		while (!pq.empty()) {
			P ppp = pq.top();
			if (ppp.first <= pp.second) {
				pq.pop();
				if (pp.second <= ppp.second) {
					pp.second = ppp.second;
				}
			} else {
				break;
			}
		}
		q.push(pp);
	}
	while (!q.empty()) {
		P qp = q.front();
		printf("%04d-%04d\n", qp.first, qp.second);
		q.pop();
	}
	return 0;
}

Submission Info

Judge Result