# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145768 | leewj1025 | 최댓값 (tutorial2) | C++14 | 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;
int max = 0;
int a[1000];
scanf("%d",&n);
for (int i = 0; i<n; i++){
scanf("%d", &a[i]);
if (max<a[i])
max = a[i];
}
printf("%d", max);
}