Submission #1215087

---

Source Code Expand

def calcs(x,y,ax,ay,bx,by) ((ax-x)*(by-y)-(bx-x)*(ay-y))/2.0 end
def inpf() a=gets.to_s.chomp.split(" ").map(&:to_f)end
def inps() a=gets.to_s.chomp.split(" ")end  
def copy(a) Marshal.load(Marshal.dump(a)) end
def kaizyo(n)(n < 2)? 1 : (2..n).inject(:*) end
def scount(a) b=na(a.max+1);a.each{|n|b[n]+=1};return b end
def na(n,d=0) Array.new(n,d)end
def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end
def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end
def bit(n) n.to_s(2).split("").map(&:to_i) end
def inp() a=gets.to_s.chomp.split(" ").map{|u|u.to_i}end
n,k=inp
a=inp
ss=na(0,"")
 
n.times do |i|
  ss.push(inps[0])
end
ni = na(0,"")
a.sort!.each do |d|
  ni.push(ss[d-1])
end
a.reverse_each do |d|
  ss.delete_at(d-1)
end
max = ""
min = ""
ni.sort!
ss.each do |s|
  if(s < ni[0])
    if(min =="")
      min = s
    elsif(s > min)
      min = s
    end
  elsif(s > ni[-1])
    if(max =="")
      max = s
    elsif(s < max)
      max = s
    end
  else
    puts -1
    exit
  end
end
drf1=""
drf2=""
if(min != "")
  x=0
  len=[min.size,ni[0].size].min
  while true
    if(x == len)
      drf1 += ni[0][x]
      break
    end
    drf1 += ni[0][x]
    break if(ni[0][x] != min[x])
    x+=1
  end
end
if(max != "")
  if(max != "")
    x=0
    len=[max.size,ni[-1].size].min
    while true
      if(x == len)
        break
      end
      drf2 += ni[-1][x]
      break if(ni[-1][x] != max[x])
      x+=1
    end
  end
end
puts (drf1.size > drf2.size)? drf1 : drf2

Submission Info

Compile Error

./Main.rb:2: warning: assigned but unused variable - a
./Main.rb:3: warning: assigned but unused variable - a
./Main.rb:11: warning: assigned but unused variable - a
./Main.rb:43: warning: ambiguous first argument; put parentheses or a space even after `-' operator
./Main.rb:12: warning: assigned but unused variable - k

Judge Result