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