# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14799 | aloshipda | 최댓값 (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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
vector<int> v;
scanf("%d",&n);
for(int i=0;i<n;++i){
int a;
scanf("%d",&a);
v.push_back(a);
}
sort(v.rbegin(),v.rend());
printf("%d",v[0]);
return 0;
}