Hey I am trying to write a function that does the following:

int positionOfMax(const string a[], int n);
Return the position of a string in the array such that that string is >= every string in the array. If there is more than one such string, return the smallest position of such a string. Return −1 if the array has no elements. For example:
string folks[6] = { "obiwan", "minnie", "han", "simba", "jabba", "ariel" };
int k = positionOfMax(folks, 6); // returns 3, since simba is latest
// in alphabetic order

I figure i could so something like
1 2 3 4 5 6 7 8 9

int positionOfMax(const string a[], int n)
{
for(int k = 0; k < n; k++)
{
if(a[k] >= a[n] && a[k] >= a[n1]&& a[k] >= a[n2]&& a[k] >= a[n3] ... && a[k] >= a[nn])
return k;
}
return 1;
}

But a couple problems are that i dont know what n is and what if n is really large.
Anyone have an idea of what i could do?