贪心算法处理活动分配问题

#include<stdlib.h>
#include<stdio.h>
struct stu{
 int start;
 int end;
 int pos;
 int flag;
 };
main(){
int i=0;
   struct stu a[11]={{1,4,0,0},{3,5,1,0},{0,6,2,0},{5,7,3,0},{3,8,4,0},{5,9,5,0},{6,10,6,0},{8,11,7,0},{8,12,8,0},{2,13,9,0},{12,14,10}};
   printf("start end  pos\n");
   for(i=0;i<11;i++)
   printf("%4d%4d%4d\n",a[i].start,a[i].end,a[i].pos);
   
   
int j=0,temp=0;
for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
if(a[j].start>a[j+1].start)
{
temp=a[j].start;
a[j].start=a[j+1].start;
a[j+1].start=temp;
temp=a[j].end;
a[j].end=a[j+1].end;
a[j+1].end=temp;
temp=a[j].pos;