# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14664 | mondo | 최댓값 (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 <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <cassert>
#include <sstream>
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N, answer = 0;
vector<int> v;
cin >> N;
v.resize(N);
while(N--) {
cin >> v[N];
if(v[N] > answer)
answer = v[N];
}
cout << answer;
return 0;
}