-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathActivity-Selection
50 lines (44 loc) · 913 Bytes
/
Activity-Selection
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
#include<iostream>
#include<algorithm>
class A{
public:
int start;
int finish;
A(){}
A(int x,int y):start(x),finish(y){}
};
bool compare(A a, A b){
return a.finish<b.finish;
}
int main()
{
int T;
std::cin>>T;
while(T--){
int n;
std::cin>>n;
A a[n];
for(int i=0;i<n;++i){
std::cin>>a[i].start;
}
for(int i=0;i<n;++i){
std::cin>>a[i].finish;
}
std::sort(a,a+n,compare);
// for(int i=0;i<n;++i){
// std::cout<<a[i].start<<" "<<a[i].finish<<"\n";
// }
int count=1,max=1;
int s = a[0].finish;
for(int i=1;i<n;++i){
if(s<=a[i].start && s<=a[i].finish){
// std::cout<<a[i].start<<" "<<a[i].finish<<"\n";
count++;
if(count>max)
max= count;
s = a[i].finish;
}
}
std::cout<<max<<"\n";
}
}