# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2003 | gs13031 | 최댓값 (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 a[100100], n, m=-1;
scanf("%d", &n);
for(int i=1; i<=n; ++i){ scanf("%d", &a[i]); m=m>a[i]?m:a[i]; }
printf("%d", m);
}