# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
508 | ohchanghun25 | 최댓값 (tutorial2) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int main()
{
int N, arr[100];
int i,Max=-1;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",&arr[i]);
Max=arr[0];
for(i=1;i<N;i++)
if(Max<arr[i])
Max=arr[i];
printf("%d",Max);
}