# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717849 | EntityPlantt | 최댓값 (tutorial2) | C++14 | 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, i = 0;
scanf("%d", &n);
int a[n];
while (i < n) {
scanf("%d", a + i++);
}
printf("%d", *std::max_element(a, a + n));
return 0;
}