Dynamic Maximum

Problem Statement

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print the maximum value.

Constraints

1 <= N <= 1000

Sample Input

5
1 5 3 9 2

Sample Output

9

Explanation

Scans heap-allocated array to find maximum element.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB