C language: structure array implementation to find the lowest student record

#include <stdio.h>
#include <string.h>
#define N 10
typedef struct ss
{
    
	char num[N];
	int s;
}STU;
void fun(STU a[] , STU *s);
int main()
{
    
	STU a[N]={
    {
    "A01",81},{
    "A02",89},{
    "A03",66},{
    "A04",87},{
    "A05",77},{
    "A06",90},{
    "A07",79}
				,{
    "A08",61},{
    "A09",90},{
    "A10",77}},m;
	int i;
	printf("************* Raw data ****************\n");
	for(i = 0 ; i < N ; i++){
    
		printf(" Student number  = %s ,  achievement  = %d\n",a[i].num , a[i].s);
	}
	fun(a,&m);
	printf("************* The result is ****************\n");
	printf(" Student number of the student with the lowest score  = %s ,  achievement  = %d\n",m.num , m.s);
	return 0;
}
void fun(STU a[] , STU *s)
{
    
	int i;
	strcpy(s->num,a[0].num);
	s->s = a[0].s;
	for(i = 0 ; i < N ; i++){
    
		if(s->s>a[i].s){
    
			strcpy(s->num,a[i].num);
			s->s=a[i].s;
		}
	}
}