-
Notifications
You must be signed in to change notification settings - Fork 4
/
7386.cpp~
99 lines (69 loc) · 1.39 KB
/
7386.cpp~
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cctype>
using namespace std;
typedef long long int lg;
lg n;
struct node
{
lg s,f;
}a[100005];
void sort(lg l,lg r)
{
lg p,i,j;
node temp;
if(l<r)
{
i=l;
j=r+1;
p=a[l].f;//bhai yaha finishing time pe sort kar rahe hai
do{
do i++;
while(a[i].f<p && i<r);
do j--;
while(a[j].f>p);
if(i<j)
{temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}while(i<j);
temp=a[l];
a[l]=a[j];
a[j]=temp;
sort(l,j-1);
sort(j+1,r);
}
}
int main()
{
lg test,i,j;
scanf("%lld",&n);
while(n!=-1)
{
for(i=0;i<n;i++)
scanf("%lld",&a[i].s);
for(i=0;i<n;i++)
scanf("%lld",&a[i].f);
sort(0,n-1);
for(i=0;i<n;i++)
cout<<a[i].s<<" "<<a[i].f<<endl;
node sl;
sl=a[0];//selected so far
cn=1;
for(i=1;i<n;i++)
{
if(a[i].s>sl.f)
cn++;
sl=a[i];
}
printf("%lld\n",cn);
scanf("%lld",&n);
}
return 0;
}