hdu2037今年暑假不AC解题报告

     
     

      
       1 
      
      /*
      
      ******** hdu 2037 ***********
      
      */
      
      

      
       2 
      
      
      
      /*
      
      ******** 琴心&剑胆 ***********
      
      */
      
      

      
       3 
      
      
      
      /*
      
      ******** 2011/4/16 ***********
      
      */
      
      

      
       4 
      
      #include
      
      <
      
      stdio.h
      
      >
      
      

      
       5 
      
      #include
      
      <
      
      stdlib.h
      
      >
      
      

      
       6 
      
      
      
      struct
      
       AC

      
       7 
      
      {

      
       8 
      
      
      
      int
      
       x,y;

      
       9 
      
      }ac[
      
      100
      
      ];

      
      10 
      
      
      
      int
      
       cmp( 
      
      const
      
       
      
      void
      
       
      
      *
      
      a ,
      
      const
      
       
      
      void
      
       
      
      *
      
      b)

      
      11 
      
      {

      
      12 
      
      
      
      return
      
       ((AC 
      
      *
      
      )a)
      
      ->
      
      y 
      
      -
      
       ((AC 
      
      *
      
      )b)
      
      ->
      
      y ;

      
      13 
      
      }

      
      14 
      
      
      
      int
      
       main(){

      
      15 
      
       
      
      int
      
       T;

      
      16 
      
       
      
      while
      
      (scanf(
      
      "
      
      %d
      
      "
      
      ,
      
      &
      
      T)
      
      !=
      
      EOF,T){

      
      17 
      
       
      
      int
      
       n
      
      =
      
      1
      
      ;

      
      18 
      
       
      
      for
      
      ( 
      
      int
      
       i
      
      =
      
      1
      
      ;i
      
      <=
      
      T;
      
      ++
      
      i )

      
      19 
      
       scanf( 
      
      "
      
      %d%d
      
      "
      
      ,
      
      &
      
      ac[i].x,
      
      &
      
      ac[i].y );

      
      20 
      
       qsort(ac,T
      
      +
      
      1
      
      ,
      
      sizeof
      
      (ac[
      
      0
      
      ]),cmp);

      
      21 
      
       
      
      int
      
       j
      
      =
      
      1
      
      ;

      
      22 
      
       
      
      for
      
      (
      
      int
      
       i
      
      =
      
      2
      
      ;i
      
      <=
      
      T;
      
      ++
      
      i){

      
      23 
      
       
      
      if
      
      (ac[i].x
      
      >=
      
      ac[j].y) {

      
      24 
      
       
      
      ++
      
      n;

      
      25 
      
       j
      
      =
      
      i;

      
      26 
      
       }

      
      27 
      
       }

      
      28 
      
       printf( 
      
      "
      
      %d\n
      
      "
      
      ,n );

      
      29 
      
       }

      
      30 
      
      }