oj.uz

Submission #145758

# Submission time Handle Problem Language Result Execution time Memory
145758 2019-08-21T06:46:27 Z kst7703 최댓값 (tutorial2) C++14
20 / 100
 2 ms 376 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int GetMax(int n, int *arr) {
	int ans = arr[0];
	for (int i = 1; i < n; i++) 
		ans = max(ans, arr[1]);
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -