# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151713 | geon0407 | 최댓값 (tutorial2) | C++11 | 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 <bits/stdc++.h>
using namespace std;
int arr[11];
int n, i;
int main(void)
{
int ans = 0;
scanf("%d", &n);
for(i=0;i<n;i++) {
int in;
scanf("%d", &in);
ans = max(ans, in);
}
printf("%d\n", ans);
return 0;
}