3.	Se citesc n intervale de forma [ai, bi), i = 1..n, unde capetele intervalelor sunt numere naturale. Sa se aleaga un numar maxim de intervale astfel īncāt oricare doua intervale alese sa nu se intersecteze. De exemplu, pentru n=6 si intervalele [8, 10), [2, 20), [4, 8), [12, 16), [3, 18), [17, 18) se aleg intervalele [4, 8), [8, 10), [12, 16), [17, 18)

#include <iostream>
using namespace std;
int n,a[3][100],g,i;
void sortare(int g[3][100])
{
	int schimb,i,aux;
	do
	{
		schimb=0;
		for(i=1;i<=n-1;i++)
			if(g[1][i]>g[1][i+1])
			{
				aux=g[1][i];
				g[1][i]=g[1][i+1];
				g[1][i+1]=aux;
				aux=g[2][i];
				g[2][i]=g[2][i+1];
				g[2][i+1]=aux;
				schimb=1;
			}
	}while(schimb);
}
int main()
{
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>a[1][i];
		cin>>a[2][i];
	}
	sortare(a);
	for(i=1;i<=n;i++)
	{
		if(a[2][i]<=a[2][i+1])
			cout<<"["<<a[1][i]<<","<<a[2][i]<<") ";
	}
	if(a[2][n-1]<=a[2][n])
		cout<<"["<<a[1][n]<<","<<a[2][n]<<") ";
	return 0;
}