# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14465 | TickingClock | 최댓값 (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, i, v, max = -1;
scanf("%d", &n);
for(i = 0; i < n; i++) {
scanf("%d", &v);
if(max < v) max = v;
}
printf("%d", max);
return 0;
}