Hero King C language

Hero King

The League of heroes finals are in full swing , Blind monk 、 Sister Dao 、 Wine barrel 、 Qinggang shadow and other heroes all appeared , When a hero is selected, the system automatically registers its serial number , The hero with the most appearances becomes the king of appearances . The set of appearances given the hero's serial number T, for example ,T={2,4,4,4,6,7}. Its appearance king is 4 Hero No , The number of appearances is 3. For a given by n An appearance set composed of sequence numbers T, Calculate the king's serial number and the number of appearances . If there are multiple kings , Please output the one with the smallest serial number .

Input format :
Number of input data 1 OK, it's a hero episode T Number of serial numbers in n（n<1000）; Second line input n Number of Heroes （ No more than 5 A natural number of digits ）.

Output format :
The second of the output data 1 The line gives the sequence number of the appearance King , The first 2 OK, it's the number of appearances .

sample input :
Here's a set of inputs . for example ：

6
2 4 4 4 6 7 

sample output :
Here is the corresponding output . for example ：

4
3

Code ：

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