# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8560 | a555 | 최댓값 (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 <stdlib.h>
#include <stdio.h>
int n, k, b = 0;
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &k);
if (b < k)b = k;
}
printf("%d\n", b);
return 0;
}