# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145781 | 2019-08-21T06:52:12 Z | j07801 | 최댓값 (tutorial2) | C++14 | 0 ms | 0 KB |
#include<stdio.h> #include<algorithm> #include<iostram> using namespace std; int mix; int GetMax(int N, int *A){ mix = A[0]; for (int i = 1; i <= N; i++){ mix = max(mix, A[i]); } return mix; }