Wooden Sticks

最新推荐文章于 2019-08-14 06:51:01 发布

森-Js

最新推荐文章于 2019-08-14 06:51:01 发布

阅读量109

点赞数

分类专栏： ACM. 贪心算法文章标签：贪心

本文链接：https://blog.csdn.net/gjs935219/article/details/82014920

版权

ACM. 同时被 2 个专栏收录

91 篇文章 2 订阅

订阅专栏

贪心算法

6 篇文章 0 订阅

订阅专栏

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25514 Accepted Submission(s): 10326

Problem Description

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:

(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup.

You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, ..., ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.

Output

The output should contain the minimum setup time in minutes, one per line.

Sample Input

4 9

5 2

2 1

3 5

1 4

2 2

1 1

2 2

1 3

2 2

3 1

Sample Output

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
int v[5005];
struct gg {
	int a;
	int b;
} p[5005];
int cmp(struct gg m,struct gg n) {
	if(m.a==n.a)
	return m.b<n.b;   //注意这个地方 
	return m.a<n.a;
}
void chushi(int n) {
	int xx,yy;
	for(int i=0; i<n; i++) {
		scanf("%d%d",&xx,&yy);
		p[i].a=xx;
		p[i].b=yy;
		v[i]=0;
	}
}
int main() {
	int t;
	scanf("%d",&t);
	while(t--) {
		int n,sum=0,c=1,k;
		cin>>n;
		chushi(n);
		sort(p,p+n,cmp);
			for(int i=0; i<n; i++) {
				k=p[i].b;
				if(v[i]==0) {
					sum++;
					for(int j=i+1; j<n; j++) {
						if(p[j].b>=k&&v[j]==0) {
							k=p[j].b;
							v[j]=1;
							v[i]=1;
						}
					}
				}
			}
			printf("%d\n",sum);
	}
}