greedy activity

#include <iostream>
using namespace std;
struct Set{
    int start;
    int end;
};
void greedyActivity(Set s[], int siz)
{
    cout << "(1) " << "[" << s[0].start << "," << s[0].end << "]" <<endl;
    int nxt = s[0].end;
    for(int i=0; i<siz; i++)
    {
        if(nxt<=s[i].start)
        {
            cout << "(" << (i+1) << ") " << "[" << s[i].start << "," << s[i].end << "]" <<endl;
            nxt = s[i].end;
        }

    }
}
int main()
{
    Set s[11] = {0};
    int start[11] = {1,3,0,5,3,5,6,8,8,2,12};
    int finish[11] = {4,5,6,7,8,9,10,11,12,13,14};
    int i,j;
    //user input.....
    for(i=0; i<11; i++)
    {
        s[i].start = start[i];
        s[i].end = finish[i];
    }
    //sort according to ending time
    for(i=1;i<11;++i)
    {
        for(j=0;j<(11-i);++j)
        {
            if(s[j].end>s[j+1].end)
            {
                swap(s[j],s[j+1]);
            }
        }
    }
    greedyActivity(s,11);
    return 0;
}