Submission #1768414


Source Code Expand

n = gets().to_i
a = gets().split.map(&:to_i)
max = -1
min = 1001
for i in 0..(n-1)
        if max < a[i] then
                max = a[i]
        end
        if min > a[i] then
                min = a[i]
        end
end
puts(max-min)

Submission Info

Submission Time
Task B - Traveling AtCoDeer Problem
User kamasaki
Language Ruby (2.3.3)
Score 200
Code Size 244 Byte
Status AC
Exec Time 7 ms
Memory 1788 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 6
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 7 ms 1788 KB
in2.txt AC 7 ms 1788 KB
in3.txt AC 7 ms 1788 KB
in4.txt AC 7 ms 1788 KB
s1.txt AC 7 ms 1788 KB
s2.txt AC 7 ms 1788 KB