Submission #3019853

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int main(){
  int n;
  cin>>n;
  vector<pair<int,int>> v;

  for(int i=1;i<=n;i++){
    int a,b;
    cin>>a>>b;
    b*=-1;

    int c=a%10,d=b%10;
    if(c<5) a-=c;
    else a-=(c-5);

    if(d==0||d==5);
    else if(d<5) b+=(5-d);
    else b+=(10-d);
    if(b%100==60) b=b+100-60;
    v.push_back(make_pair(a,b));
  }

  sort(v.begin(),v.end());
  vector<pair<int,int>> ans;
  int c=0;
  ans.push_back(make_pair(v[0].first,v[0].second));
  for(int i=1;i<n;i++){
    if(ans[c].second<v[i].first){
      ans.push_back(make_pair(v[i].first,v[i].second));
      c++;
    }else if(ans[c].second==v[i].first){
      ans[c].second=v[i].second;
    }else{
      ans[c].second=max(ans[c].second,v[i].second);
    }
  }
  
  for(int i=0;i<=c;i++){
    cout<<setfill('0')<<setw(4)<<right<<ans[i].first;
    cout<<"-";
    cout<<setfill('0')<<setw(4)<<right<<ans[i].second<<endl;
  }
  return 0;
}

Submission Info

Judge Result