Help me in solving CLB086 problem

My issue

include <stdio.h>

int main() {
int T; // Number of test cases
scanf(“%d”, &T);

while (T--) {
    int N; // Number of mountains
    scanf("%d", &N);
    
    int max_height = 0; // Initialize max_height with a low value
    for (int i = 0; i < N; i++) {
        int height;
        scanf("%d", &height);
        if (height > max_height) {
            max_height = height;
        }
    }
    
    // Print the maximum height for the current test case
    printf("%d\n", max_height);
}

return 0;

}

My code

#include <stdio.h>

int main(void) {
    
	 int arr[5] = {1, 2, 3, 4, 5};
	 
	 for(int i = 0, i < 5, i++){
	     printf("%d", arr[i]);
	 }

	 return 0;

}


Learning course: Data structures & Algorithms lab
Problem Link: https://www.codechef.com/learn/course/muj-dsa-c/MUJDSAC05/problems/CLB086