| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 4935 | jumax1008 | 최댓값 (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>
using namespace std;
int main()
{
  int n,in[10],max_=0;
  cin>>n;
  for(int i=0 ; i<n;  i++)
  {  cin>>in[i];
   if(max_<in[i])
     max_=in[i];
  }
  cout<<max_;
  return 0;
}
