Help me in solving DSAAGP11 problem

help
,
1

My issue

include <stdio.h>

int main() {
// your code goes here
int n;
scanf(“%d”,&n);
int arr[n];
for(int i=0;i<n;i++){
scanf(“%d”,&arr[i]);
}
int max=arr[n-1];
printf(“%d”,max);
for(int i=n-2;i>=0;i–){
if(arr[i]>max){
printf(“%d”,arr[i]);
}
}
return 0;
}

My code

#include <stdio.h>

int main() {
	// your code goes here
int n;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++){
    scanf("%d",&arr[i]);
}
int max=arr[n-1];
printf("%d",max);
for(int i=n-2;i>=0;i--){
    if(arr[i]>max){
        printf("%d",arr[i]);
    }
}
return 0;
}

Learning course: Data Structures & Algorithms using C
Problem Link: Leader of an Array in Data Structures & Algorithms using C