Submission #2488486

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int main(){
  int N;
  int s,e;
  int index;
  cin >> N;
  vector<pair<int,int> > pairs(N);
  for(int i=0;i<N;i++){
    cin >> s >> e;
    s -= s%5;
    e *= (-1);
    e += (5 - e%5)%5;
    if(e%100 == 60) e += 40;
    pairs[i] = make_pair(s,e);
  }
  sort(pairs.begin(), pairs.end());
  for(int i=0;i<N;i++){
    s = pairs[i].first;
    e = pairs[i].second;
    index = i;
    for(int j=i+1;j<N;j++){
      if(pairs[j].first <= e){
        if(e < pairs[j].second){
          e = pairs[j].second;
        }
        index = j;
      }
    }
    i = index;
    for(int k=10;k<=1000;k*=10) if(s < k) cout << "0";
    cout << s << "-";
    for(int k=10;k<=1000;k*=10) if(e < k) cout << "0";
    cout << e << endl;
  }
  return 0;
}

Submission Info

Judge Result