Ideone.com

fork download

copy

#include<bits/stdc++.h>
using namespace std;
#define MAXN 100003
pair<int,int> Time[MAXN];
bool mycmp(const  pair<int,int>&a ,const  pair<int,int> &b)
{
    if(a.second==b.second)
        return (a.first<b.first);
    else
        return (a.second <=b.second);
}
int maxActivities(int n)
{
    int i,j,f,c;
 
 
    f=Time[0].second;
    i=1;c=1;
    while(i<n)
    {
        while(i<n && Time[i].first<f)
            i++;
        if(i==n)
            break;
 
        f=Time[i].second;
        c++;
        i++;
 
    }
 
    return c;
}
int main()
{
    int T,n;
    int i,j;
 
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d %d",&(Time[i].first),&(Time[i].second));
 
        sort(Time,Time+n,mycmp);
 
//        printf("max no of activities that can be performed is %d\n",maxActivities(n));
        printf("%d\n",maxActivities(n));
    }
 
 
    return 0;
}

Time limit exceeded #stdin #stdout 5s 4540KB

stdin

copy

Standard input is empty

stdout

copy

Discover > Sphere Engine API

Discover > IDE Widget

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language