Submission #2409133
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main(){ int N; int a[100]; int max_num,min_num; cin >> N; for (size_t i = 0; i < N; i++) { cin >> a[i]; } max_num = a[0]; min_num = a[0]; for (size_t i = 1; i < N; i++) { max_num = max(max_num,a[i]); min_num = min(min_num,a[i]); } cout << max_num - min_num << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Traveling AtCoDeer Problem |
User | hurry70 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 499 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |