# UVa-10020 - Minimal coverage

The Problem

Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M].

The Input

The first line is the number of test cases, followed by a blank line.

Each test case in the input should contains an integer M(1<=M<=5000), followed by pairs "Li Ri"(|Li|, |Ri|<=50000, i<=100000), each on a separate line. Each test case of input is terminated by pair "0 0".

Each test case will be separated by a single line.

The Output

For each test case, in the first line of output your programm should print the minimal number of line segments which can cover segment [0,M]. In the following lines, the coordinates of segments, sorted by their left end (Li), should be printed in the same format as in the input. Pair "0 0" should not be printed. If [0,M] can not be covered by given line segments, your programm should print "0"(without quotes).

Print a blank line between the outputs for two consecutive test cases.

Sample Input

2

1
-1 0
-5 -3
2 5
0 0

1
-1 0
0 1
0 0
Sample Output

0

1
0 1
Alex Gevak

September 10, 2000 (Revised 2-10-00, Antonio Sanchez)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
int m;
cin >> m;
while(m--)
{
int r;
vector<int> number;
cin >> r;
for(int i = 0; i < r; ++i)
{
int temp;
cin >> temp;
number.push_back(temp);
}
sort(number.begin(), number.end());// 排序
int mid_tag = r / 2;
int medians = number[mid_tag], distance = 0, i;
for(i = 0; i <= mid_tag; ++i)
{
distance += number[mid_tag] - number[i];
}
for(;i < r; ++i)
{
distance += number[i] - number[mid_tag];
}
cout << distance << endl;
}
return 0;
}

12-05 567

04-13 414

04-24 861

08-16 1326

03-28 22

08-23 134

09-13 403

07-20 419

09-25 214