Schedule - Greedy algorithm

#include <stdio.h>
#include <stdlib.h>
#define s 11
struct data
{
    char name;
    int start,end;
}element[s];
int main()
{
    int i=0,j,temp,n;
    char tmp;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        printf("Enter starting time:\n");
        scanf("%d",&element[i].start);
        printf("Enter finishing time:\n");
        scanf("%d",&element[i].end);
        printf("Enter name:\n");
        fflush(stdin);
        scanf("%c",&element[i].name);
    }
    for (i = 0; i < n; i++)
        {
        for (j = i ; j < n+1; j++)
            {
            if (element[i].end >= element[j].end)
                {
                temp = element[j].start;
                element[j].start = element[i].start;
                element[i].start = temp;

                temp = element[j].end;
                element[j].end = element[i].end;
                element[i].end = temp;

                tmp = element[j].name;
                element[j].name = element[i].name;
                element[i].name = tmp;
                }
            }
        }
        for(i=0;i<n;i++)
        {
            printf(" %c ",element[i].name);
        }
        i=0;
        printf("Selected Jobs: %c",element[i].name);
        for(j=1;j<=n;j++)
        {
            if(element[j].start>=element[i].end)
            {
                printf(" %c",element[j].name);
                i=j;
            }

        }
        getchar();
        getchar();
    return 0;
}