# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3241 | BothEarRim | 최댓값 (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 <algorithm>
int GetMax(int N, int *A){
int res = A[0];
for(int i=1; i<N; i++) res = max(res, A[i]);
return res;
}