zoj4120(优先队列）

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#include<set>
#define N 110
#define LL long long
using namespace std;
const int inf = 0x3f3f3f3f;
struct node
{
	LL st, ed;
	node(LL xx, LL yy)
	{
		st = xx, ed = yy;
	}
	bool friend operator < (node t1, node t2)
	{
		if (t1.st != t2.st)
			return t1.st > t2.st;
		return t1.ed > t2.ed;
	}
};
int main()
{
	int T;
	scanf("%d", &T);
	while (T--)
	{
		int n;
		LL st, ed;
		scanf("%d", &n);
		priority_queue<node>w;
		for (int i = 1; i <= n; i++)
		{
			scanf("%lld %lld", &st, &ed);
			w.push(node(st, ed));
		}
		LL maxx = 0;
		int ans = 0;
		while (!w.empty())
		{
			node top = w.top();
			w.pop();
			if (top.st <= maxx && top.st + 1 <= top.ed) {
				w.push(node(top.st + 1, top.ed));
				continue;
			}
			if (top.st > maxx)ans++, maxx = max(maxx, top.st);
		}
		printf("%dn", ans);
	}
	return 0;
}