Activity Selection Problem - solution accepted GeekforGeeks

activity-selection-problem.c

/**
    Activity Selection Problem
    https://en.wikipedia.org/wiki/Activity_selection_problem
 */
#include <stdio.h>
#define FIN "activity2.in"
#define FOUT "activity.out"

#define SIZE 100

typedef struct activity {

        int start,
            end,
            key;

} activity;

activity spectacle[ SIZE ];

int number_of_spectacles;

int sol[SIZE],

    countSol;

void sort();

void greedy();

int main() {

    int T, it;
    
    scanf("%d", &T); 
    
    while(T--) {   

       scanf("%d", &number_of_spectacles);

       for(it = 1; it <= number_of_spectacles; it++)

        scanf("%d",&spectacle[it].start);

       for(it = 1; it <= number_of_spectacles; it++)
       
        scanf("%d",&spectacle[it].end);
        
      sort();
      
      greedy();
      
      printf("%d\n", countSol);
    }
};

void sort() {

     activity temp;

     int i, swapped = 1;

     while(swapped) {

           swapped = 0;

           for(i = 1; i < number_of_spectacles; i++) {

                   if(spectacle[i].end > spectacle[i+1].end) {

                       temp = spectacle[i];

                       spectacle[i] = spectacle[i+1];

                       spectacle[i+1] = temp;

                       swapped = 1;  
                   } 
           }  
     }
     
};

void greedy() {

     int i, j = 1;

     sol[ j ] = 1; 

     for(i = 2; i <= number_of_spectacles;i++) {

             if(spectacle[i].start >= spectacle[sol[j]].end) {

                    sol[++j] = i;
             }

        countSol = j; 
     }
       
};