解析:左边的值及其减1的值一起压入vlr中,右边的值及其右加1的值也一起压入vlr中,排序,将最左的值和最右的值去掉。接下来的数据两两配对则为合并和拆分的集合。
接下来再判断原集合最左边的数据是否落在拆分的集合内,有则输出。
#include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
/*
输入:组件个数n
{组件1左范围,组件1右范围} 组件1key值
……
{组件n左范围,组件n右范围} 组件nkey值
输出:{左范围1,左范围1} 对应组件值,","隔开
*/
int main(void)
{
int n;
cin>>n;
vector<int> vlr,m;
vector<pair<int,int>> v;
for (int i = 0; i < n; i++){
int l, r, id;
scanf_s("\n{%d,%d} %d", &l, &r, &id);
vlr.push_back(l-1);
vlr.push_back(l);
vlr.push_back(r);
vlr.push_back(r+1);
v.push_back(make_pair(l, r));
m.push_back(id);
}
sort(vlr.begin(), vlr.end());
for (int i = 1; i < vlr.size()-2; i += 2){
vector<int> ID;
for (int j = 0; j < v.size(); j++){
if (vlr[i] >= v[j].first && vlr[i] <= v[j].second){
ID.push_back(m[j]);
}
}
if (ID.size()){
cout << "{" << vlr[i] << "," << vlr[i + 1] << "} ";
for (int i = 0; i < ID.size()-1; i++){
cout << ID[i] << ",";
}
cout << ID[ID.size() - 1] << endl;
}
}
return 0;
}