def non_standard_greedy(list_, measure_fn):
    """
    Solve a non-standard partition problem with a "greedy" algorithm.

    .. warning::
        A "greedy" algorithm may not return the optimal solution.

    :param list_: List of elements of any type
    :type list_: list
    :param measure_fn: Function for measure to be minimised for two sub-sums
    :type measure_fn: function

    :returns: Sums of two subsets, chosen such that measure minimised
    :rtype: list

    :Example:

    >>> non_standard_greedy(example_list, example_fn)
    [195.31, 193.45000000000002]
    """
    sum_1 = 0.0
    sum_2 = 0.0
    for item in list_:
        trial_1 = sum_1 + item
        measure_1 = measure_fn(trial_1, sum_2)
        trial_2 = sum_2 + item
        measure_2 = measure_fn(sum_1, trial_2)
        if measure_1 < measure_2:
            sum_1 = trial_1
        else:
            sum_2 = trial_2
    sums = [sum_1, sum_2]
    return sums
