Check my approach i found it worth sharing.
quicksort(a,0,10);
q=a[11-p]; \* p is the number of scores req., checking the first number in the list, storing it as q! *\
for(i=0;i<=10;i++)
if(a[i]==q)
f++; \*number of q's in the array of 11 *\
for(i=11-p;i<=10;i++)
if(a[i]==q)
c++; \*number of q's in the array of p. *\
ncr = find_ncr(f,c);
printf("%lld\n",ncr);