Find Gold

#include <stdio.h>
#include <string.h>


typedef struct emas {
    char nama[100];
    int nilnam;
    char pos;
    int berat;
    int jual;

}emas;
int main()
{
    int i,n,n1,x,y,j,berat,jual,i1;
    char barang[100],ler[100];
    char arah[5]="kanan";
    scanf("%d",&n);

        emas play[6][6];
        emas joko[100];
        emas temp;


    for(i=0;i<n;i++)
{
    scanf("%d%d %s %d %d",&x, &y, &barang, &berat, &jual);
    play[y][x].pos= 'O';
    play[y][x].berat = berat;
    play[y][x].jual=jual;
}

        scanf("%d",&n1); getchar();
    for(i=0;i<n1;i++)
    {
        gets(joko[i].nama);
        x=0;y=0;
        while (x!=5 || y!=5)
        {
            gets(ler);
            //getchar();
        //  printf("%s",ler);
            if((strcmp(ler,arah)==0) ) x++;  else if(strcmp(ler,"kanan")==0 && x+1>=6) printf("Gak bisa...\n");
            if((strcmp(ler,"kiri")==0)  && (x-1>=0)) x--; else if(strcmp(ler,"kiri")==0 &&x-1<0) printf("Gak bisa...\n");
            if((strcmp(ler,"atas")==0) && (y+1<6)) y++;   else if(strcmp(ler,"atas")==0 &&y+1>=6) printf("Gak bisa...\n");
            if((strcmp(ler,"bawah")==0)  && (y-1>=0)) y--;else if(strcmp(ler,"bawah")==0 &&y-1<0) printf("Gak bisa...\n");
            if(play[y][x].pos=='O') joko[i].nilnam = (play[y][x].jual - play[y][x].berat);

            //printf("%d%d",x,y);
    //  printf("%d-", joko[i].nilnam);
        }

        if(x==5&&y==5) printf("%s telah sampai\n",joko[i].nama);
    }
    //sorting untung
    for (i1 = 0; i1 <n1; i1++)
    {
        //min = i;
            for (j=i1+1;j<n1;j++)
            {
                if(joko[j].nilnam>joko[i1].nilnam)
                {

                    temp = joko[j];
                    joko[j]=joko[i1];
                    joko[i1]=temp;
                    //printf("d");

                } else if(joko[j].nilnam==joko[i].nilnam)
                {
                    if((strcmp(joko[j].nama,joko[i].nama))>0)
                    {
                    temp = joko[j];
                    joko[j]=joko[i];
                    joko[i]=temp;
                    }

                }

        }
    }
        //sorting nama
        //output
        for(i=0;i<n1;i++) printf("%s\n",joko[i].nama);
    return 0;
}

//1
//4 4 emas 10 100
//1
//Rianad
//kiri
//kanan
//kanan
//kanan
//kanan
//kanan
//atas
//atas
//atas
//atas
//atas