Submission #3583011

Source Code Expand

n = gets.to_i
a = Array.new(n).map{[0,0]}
n.times do |i|
    a[i] = [gets.to_i,i%2]
end
a.sort!
ans = 0
((n+1)/2).times do |i|
    ans += 1 if a[i*2][1] == 1
end
puts ans

Submission Info

Submission Time
Task C - BBuBBBlesort!
User koikotya
Language Ruby (2.3.3)
Score 600
Code Size 180 Byte
Status AC
Exec Time 536 ms
Memory 17400 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 24
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 533 ms 15976 KB
02.txt AC 534 ms 15992 KB
03.txt AC 533 ms 15976 KB
04.txt AC 534 ms 15992 KB
05.txt AC 530 ms 15992 KB
06.txt AC 529 ms 15976 KB
07.txt AC 528 ms 15976 KB
08.txt AC 321 ms 15984 KB
09.txt AC 321 ms 15984 KB
10.txt AC 332 ms 15976 KB
11.txt AC 333 ms 15992 KB
12.txt AC 332 ms 15984 KB
13.txt AC 331 ms 15984 KB
14.txt AC 533 ms 15976 KB
15.txt AC 536 ms 17400 KB
16.txt AC 528 ms 15976 KB
17.txt AC 532 ms 15992 KB
18.txt AC 7 ms 1788 KB
19.txt AC 7 ms 1788 KB
20.txt AC 7 ms 1788 KB
21.txt AC 7 ms 1788 KB
22.txt AC 6 ms 1788 KB
s1.txt AC 7 ms 1788 KB
s2.txt AC 7 ms 1788 KB