Exercise 7-2 finding the maximum value and its subscript (20 points)

This question requires the preparation of procedures , Find the given n The maximum number and its corresponding minimum subscript （ Subscript from 0 Start ）.

Input format :

Input gives a positive integer in the first line n（1<n≤10）. Second line input n It's an integer , Separate with spaces .

Output format :

Output the maximum value and the minimum subscript of the maximum value in one line , Separated by a space .

sample input :

6
2 8 10 1 9 10

sample output :

10 2

The code is as follows ：

#include<stdio.h>
int main()
{
    int n,i,j,max=0;
    scanf("%d",&n);
    int a[n];
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(i=1;i<n;i++){
     if(a[i]>a[max]){
         max=i;
     }
    }
    printf("%d %d\n",a[max],max);
    return 0;
}