# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
540546 |
2022-03-20T22:11:04 Z |
glome |
Po (COCI21_po) |
C++17 |
|
11 ms |
1620 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> y(n);
for (int i = 0; i<n; i++) {
cin >> y[i];
}
cout << *max_element(y.begin(), y.end()) - *min_element(y.begin(), y.end()) + 1<< '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
4 |
Incorrect |
4 ms |
596 KB |
Output isn't correct |
5 |
Incorrect |
6 ms |
724 KB |
Output isn't correct |
6 |
Correct |
11 ms |
1620 KB |
Output is correct |
7 |
Incorrect |
10 ms |
1620 KB |
Output isn't correct |