Submission #1694915

---

Source Code Expand

import qualified Data.ByteString.Char8 as BC
import Data.Maybe (fromJust)
import Control.Monad
--import Data.Sequence
import Prelude
import System.IO
import Data.List

-- a <- replicateM n readLn
-- mapM_ print $

main = do
    n <- readLn
    a <- replicateM n getLine
    putStrLn $ solve a

solve :: [String] -> String
solve a = connect $ take 2 $ sort a

connect :: [String] -> String
connect (a:b) = a ++ (head b)

-- リストに関数を適用する。map だと1変数関数しか使えない悲しみ。
--map' :: ([Int] -> Int -> Int -> Int) -> [Int] -> [Int] -> [Int]
map' _ _ [] = []
map' f a (i:is) = f a i 0 : map' f a is

-- t と等しい最初の要素の index を返す。あとで直す
search :: [Int] -> Int -> Int -> Int
search a t i = if a!!i == t
    then i
    else search a t (i + 1)

Submission Info

Judge Result