贪心算法：活动安排

#include
using namespace std;


int Num;
int Current=1;
int *r=new int[11];
void sort(int * num,int *num2)
{
for(int j=2;j<=Num;j++)
{
int key=num[j];
int key2=num2[j];
int i=j-1;
while(i>=0 && num[i]>key)
{
num[i+1]=num[i];
num2[i+1]=num2[i];
i--;
}
num[i+1]=key;
num2[i+1]=key2;
}
}
void RECURSIVE_ACTIVITY_SELECTOR(int *s,int *f,int i,int j)
{
int m=i+1;
while(m{
m=m+1;
}
if(m<=j)
{
r[++Current]=m;
RECURSIVE_ACTIVITY_SELECTOR(s,f,m,j);
}
}

void main()
{
cout<<"please input how many activity:"<cin>>Num;

int *s=new int[Num];
int *f=new int[Num];

for(int i=1;i{
cin>>s[i];
}
for(i=1;i{
cin>>f[i];
}
sort(f,s);
r[1]=1;
RECURSIVE_ACTIVITY_SELECTOR(s,f,1,Num);
for(i=1;i<=Current;i++)
{
cout<}
}