Ravintola

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#define F first
#define S second
using namespace std;
int n;

vector<pair<pair<int, int>, int> > ab;
vector<pair<int, int> > ansp;


int mt[101010];
int st[101010];

set<pair<int, int> > pt;

int main(){
  cin >> n;
  for (int i=0; i<n; ++i){
    int a, b;
    cin >> a >> b;
    ++mt[a]; --mt[b];
    ab.push_back(make_pair(make_pair(a, b), i+1));
  }sort(ab.begin(), ab.end());
  for (int i=1; i<101010; ++i)st[i]=st[i-1]+mt[i];
  int ans=0;
  for (int i=0; i<101010; ++i) ans=max(ans, st[i]);
  cout << ans << "\n";
  for (int i=1; i<=ans; ++i){
    pt.insert(make_pair(0, i));
  }
  
  for (int i=0; i<n; ++i){
    int a=ab[i].F.F;
    int b=ab[i].F.S;
    int ix=ab[i].S;
    set<pair<int, int> >::iterator it=pt.lower_bound(make_pair(-a, 0));
    ansp.push_back(make_pair(ix, (*it).second));
    pt.insert(make_pair(-b, (*it).second));
    pt.erase(it);
  }
  sort(ansp.begin(), ansp.end());
  for (int i=0; i<n; ++i){
    cout << ansp[i].S <<"\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: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR