龐果網題目之一！

#include<stdio.h>
int forjob(int *start,int *end,int n)
{
   //·µ»ØÄܲμӵÄÕÐƸ¸öÊýµÄÊýÖµn
    
int tmp1;
int tmp2;
int i,j;
int max = 0;
int sum = 1;
     
for(i = 0;i < n-1;i++)
{
for(j = 0;j < n-i-1;j++)
{
if(start[j+1] < start[j])
{
tmp1 = start[j+1];
tmp2 = end[j+1];

start[j+1] = start[j];
end[j+1] = end[j];

start[j] = tmp1;
end[j] = tmp2;
}
}
}
  
for(i = 0;i < n-1;i++)
{
       for(j = 0;j<n-i-1;j++)
  {
  if(start[j+1] >= end[j])
  {
  sum++;
  }
  }
  if(max<sum)
  {
  max = sum;
  sum = 1;
  }
}

return max;

}

//start Ìáʾ£º×Ô¶¯ÔľíÆðʼΨһ±êʶ£¬ÇëÎðɾ³ý»òÔö¼Ó¡£
int main()
{    
    int pStart[3] = {9,10,8};
int pEnd[3] = {10,20,15};
int n = 3;
printf("%d\n",forjob(pStart,pEnd,n));

}

//end //Ìáʾ£º×Ô¶¯Ôľí½áÊøΨһ±êʶ£¬Ç

http://hero.pongo.cn/home/index