# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243458 | prarie | 최댓값 (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.
int GetMax(int N, int *A){
int ans = a[0];
for (int i = 1; i < N; i++) {
if (ans < a[i]) ans = a[i];
}
return ans;
}