import List (sort)

solveCoin :: Integer -> [Integer] -> [[Integer]]
solveCoin total coins = 
  let coins' = reverse $ sort coins

bubbleSort :: Ord a => [a] -> [a]
bubbleSort = bubbleSortBy compare

bubbleSortBy :: Ord a => (a -> a -> Ordering) -> [a] -> [a]
bubbleSortBy _ [] = []

bubbleSort :: Ord a => [a] -> [a]
bubbleSort = bubbleSortBy compare

bubbleSortBy :: Ord a => (a -> a -> Ordering) -> [a] -> [a]
bubbleSortBy cmp xs = bubbleSortBy' cmp xs []

import List

-- shell sort
shellSort :: Ord a => [a] -> [a]
shellSort = shellSortBy compare

mergeSort :: Ord a => [a] -> [a]
mergeSort = mergeSortBy compare

mergeSortBy :: Ord a => (a -> a -> Ordering) -> [a] -> [a]
mergeSortBy _ [] = []

mergeSort :: Ord a => [a] -> [a]
mergeSort = mergeSortBy compare

mergeSortBy :: Ord a => (a -> a -> Ordering) -> [a] -> [a]
mergeSortBy cmp xs = mergeSortBy' cmp xs $ length xs

mergeSort :: Ord a => [a] -> [a]
mergeSort = mergeSortBy compare

mergeSortBy :: Ord a => (a -> a -> Ordering) -> [a] -> [a]
mergeSortBy cmp [] = []

import List

insertionSort :: Ord a => [a] -> [a]
insertionSort = insertionSortBy compare

insertionSort p [] = []
insertionSort p (x:xs) = fst $ foldl (\(os,m) n -> if not (p m n) then ((insert p os n), m) else (os++[n], n)) ([x], x) xs
    
insert p os u = ls ++ (u:hs)
    where

insertionSort p [] = []
insertionSort p (x:xs) = fst $ foldl (\(os,m) n -> if m > n then ((insert p os n), m) else (os++[n], n)) ([x], x) xs
    
insert p os u = ls ++ (u:hs)
    where

insertionSort p [] = []
insertionSort p (x:xs) = fst $ foldl (\(os,m) n -> if m > n then ((insert p os n), m) else (os++[n], n)) ([x], x) xs
    
insert p os u = ls ++ (u:hs)
    where

insertionSort [] = []
insertionSort (x:xs) = fst $ foldl (\(os,m) n -> if m > n then ((insert os n), m) else (os++[n], n)) ([x], x) xs

insert os u = ls ++ (u:hs)
    where

insertionSort :: (Ord a) => (a -> a -> Bool) -> [a] -> [a]
insertionSort p [] = []
insertionSort p (x:xs) = insertionSort' [x] xs
    where
        insertionSort' os [] = os

insertionSort :: (Ord a) => (a -> a -> Bool) -> [a] -> [a]
insertionSort p [] = []
insertionSort p (x:xs) = insertionSort' [x] xs
    where
        insertionSort' os [] = os

insertionSort :: (Ord a) => [a] -> [a]
insertionSort [] = []
insertionSort (x:xs) = insertionSort' [x] xs

insertionSort' :: (Ord a) => [a] -> [a] -> [a]