123.cpp

会场安排问题 完成简单的数据排序 给出最优的解决方案数

#include <iostream>
using namespace std;
int Partition(int a[], int low, int high )//划分
{
 int i,j;
 int x = a[low];
 i = low;
 j = high;
 while(i<j)
 {
  while(i<j&&x < a[j])
  {
   j = j - 1;
  }
  if(i<j)
  {
          a[i] = a[j];
    i=i+1;
  }
      
  while(i<j&&x >= a[i])
  {
   i = i + 1;
  }
  if(i<j)
  {
         a[j] = a[i];
   j=j-1;
  }

 }
 a[i] = x;
 return i;
}

void QuickSort(int a[], int low, int high)
{
 int Position;
 if(low < high)
 {
  Position = Partition(a,low,high);
  QuickSort(a, low, Position-1);
  QuickSort(a, Position+1, high);
 }
}

 int schedule(int a[],int b[],int s,int e)
 {
      int n=0;
   int i=s+1;
   if (a[s]>-1)
      {     
        n=1;
              for(;i<=e;i++)
           if(a[i]>=b[s])    //有一个活动结束，新活动可在已空闲的会场进行。
          s++;
            else
            n++;       //要增开一会场     
   }  
   return n;
 }
int main( )
{
  int n; 
  cin>>n; 
  int *st= new int[n];
  int *et=new int[n];
  for(int i=0;i<n;i++)
      cin>>st[i]>>et[i];     
      QuickSort(st,0,n-1);
   QuickSort(et,0,n-1);
   cout<< schedule(st,et,0,n-1) <<endl;
   delete []st;
   delete []et;
   return 0;
}