# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12831 | yongwhan | 최댓값 (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<iostream>
#include<algorithm>
using namespace std;
int main() {
int n; cin>>n;
int x; cin>>x; n--;
int mx=x;
for (int i=0; i<n; i++) cin>>x, mx=max(mx,x);
cout << mx << endl;
return 0;
}