Ravintola

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#define ll long long

using namespace std;

int main () {
	int n;
	cin>>n;
	//vector<pair<int, int>> v(n);
	vector<pair<int, pair<int, int>>> o(2 * n);
	for (int i = 0; i < n; i++) {
		int a, b;
		cin>>a>>b;
		//v[i] = make_pair(a, b);
		o[2 * i] = make_pair(a, make_pair(1, i));
		o[2 * i + 1] = make_pair(b, make_pair(-1, i));
	}
	int c = 0;
	int m = 0;	
	sort(o.begin(), o.end());
	
	priority_queue<int> q;
	for (int i = 0; i < 100000; i++) q.push(-i);
	//cout<<q.top()<<endl;
	int v[n];
	for (pair<int, pair<int, int>> p : o) {
		c += p.second.first;
		m = max(m, c);
		if (p.second.first == 1) {
			v[p.second.second] = q.top();
			q.pop();
		} else {
			q.push(v[p.second.second]);
		}
	}

	cout<<m<<"\n";
	for (int i : v) cout<<-i + 1<<"\n";
	
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED