描述
An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.
输入
The first line of the input contains the number of intervals n, 1 <= n <= 10000. Each of the following n lines contains two integers a, b separated by a single space, 0 <= a < b <= 10000. They are the beginning and the end of an interval.
输出
Output the minimal number of elements in a set containing at least two different integers from each interval.
样例输入
4
3 6
2 4
0 2
4 7
样例输出
4
题意
找出一个集合,使集合与给出的每个区间都至少有两个元素相同
思路:
一开始我区间按照右端点的大小排序,选择每个区间的靠后位置选数,以为这样可以让这个数被尽可能多的区间包含,但是发现了一个不好处理的情况,选A明显比选bc都好。
最好的办法是把所有区间按照右端排列,选最右端的数,这样才能达到真正的贪心效果。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct aa
{
int l;
int r;
};
bool cmp(aa a,aa b)
{
if(a.r<b.r)
return true;
else if(a.r==b.r)
if(a.l>b.l)
return true;
return false;
}
int main()
{aa a[10001];
int k[2];
int t;
cin>>t;
for(int i=1;i<=t;i++)
cin>>a[i].l>>a[i].r;
sort(a+1,a+1+t,cmp);
k[0]=a[1].r-1;
k[1]=a[1].r;
int sum=2;
for(int i=2;i<=t;i++)
{if(a[i].l<=k[0])continue;
if(a[i].l>k[0]&&a[i].l<=k[1])
{
k[0]=k[1];
k[1]=a[i].r;
sum++;
continue;
}if(a[i].l>k[0])
{
k[0]=a[i].r-1;
k[1]=a[i].r;
sum+=2;
}
}
cout<<sum;
}