# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7047 | moonrabbit2 | 최댓값 (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 <cstdio>
#include <algorithm>
int main()
{
int n,a,i,nmax=-1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
nmax=std::max(nmax,a);
}
printf("%d",nmax);
return 0;
}