Take n largest items Haskell

baseDown.hs

module CodeWars.Largest (largest) where
import Data.List (sortBy, sort)
import Data.Ord (comparing, Down)

largest :: Ord a => Int -> [a] -> [a]
largest n xs = sort $ take n $ sortBy (comparing Down) xs

-- Line 6 causes compilation error:
-- • Data constructor not in scope: Down :: a -> a0
-- • Perhaps you want to add ‘Down’ to the import list
--   in the import of ‘Data.Ord’ (/tmp/flycheck15029c7f:3:1-33).
--   | (haskell-stack-ghc)

customDown.hs

module CodeWars.Largest (largest) where
import Data.List (sortBy, sort)
import Data.Ord (Ordering)

compDown :: Ord a => a -> a -> Ordering
compDown a b = case (compare a b) of
  LT -> GT
  EQ -> EQ
  GT -> LT

largest :: Ord a => Int -> [a] -> [a]
largest n xs = sort $ take n $ sortBy compDown xs

-- This version works