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