#include
#include
using namespace std;
int main(){
int t;
cin>>t;
int n,m=0;
for(int p=1;p<=t;p++){
cin>>n;
int a[n][2];
int s[n*(n-1)];
for(int i=0;i<n;i++){
cin>>a[i][0]>>a[i][1];
}
for(int j=0;j<n;j++){
int k=1;
for(int e=0;e<n;e++){
if(j!=e){
if(a[j][1]<=a[e][0])
k++;
}
}
s[m]=k;
m++;
}
int max=s[0];
for(int i=0;i<n;i++){
if(max<s[i])
max=s[i];
}
cout<<max<<endl;
}
}
@Harshit-Jha-2364832040305354
hello harshit,
ur algorithm is not correct,
pls refer this-> https://www.geeksforgeeks.org/activity-selection-problem-greedy-algo-1/
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.