活动选择问题

PRoblem Description

Input

Output

Example Input

1215 2015 198 1810 154 146 125 102 93 80 73 41 3
Example Output
5#include<stdio.h>struct node{    int begin;    int end;    int ans;}show[111],t;int main(){    int n,i,j,k,num;    while(~scanf("%d",&n))    {        num=0;k=0;        for(i=0;i<n;i++)        {            scanf("%d%d",&show[i].begin,&show[i].end);            show[i].ans=i+1;        }        for(i=0;i<n;i++)        {            for(j=0;j<n-i-1;j++)            {                if(show[j].end>show[j+1].end)                {t=show[j];show[j]=show[j+1];show[j+1]=t;}            }        }        for(i=0;i<n;i++)        {            if(show[i].begin>=k)            {                k=show[i].end;                num++;            }        }        printf("%d/n",num);    }    return 0;}