Which 1032 Excavator strong, C

#include <stdio.h>

int main()
{
    //int a[100003] = {0};提前占用好内存也可以，不过占用较大空间
    int n,x,score,max=-1,m=-1,n2=0,n3;
    scanf("%d",&n);
    int a[n];
    n2 = n;
    n3 = n;
    while(n2)	//将a[n]的数据全部更新为0
    {
        a[n2] = 0;
        n2--;
    }

    while(n)
    {
        scanf("%d %d",&x,&score);
        a[x] += score;
        n--;
    }
    
    while(n<=n3)   //如果用a[n]！=0来判断，则没有考虑总分为0的情况，会扣分
    {
        if(a[n]>max)
            {m = n; max = a[n];}
        n++;
    }

    printf("%d %d",m,max);

    return 0;
}