// https://atcoder.jp/contests/abc145/tasks/abc145_f
//
#![allow(unused_imports)]
use std::io::*;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

const INF: i64 = 1e16 as i64;

fn main() {
    input! {
        n: usize, k: usize,
        h: [i64; n]
    };

    let mut hh = h.clone();
    hh.push(0);
    hh.sort();
    hh.dedup();
    let hn = hh.len();
    let mut hidx = vec![0; n];
    {
        let mut hmap = HashMap::new();
        for i in 0..hn {
            hmap.insert(hh[i], i);
        }
        for i in 0..n {
            hidx[i] = *hmap.get(&h[i]).unwrap();
        }
    }
    assert!(hh[0] == 0);
    let mut dp = dvec!(INF; n+1, k+1, hn);
    dp[0][0][0] = 0;

    for i in 0..n {
        for j in 0..k+1 {
            for l in 0..hn {
                let base = dp[i][j][l];
                if base == INF {
                    continue;
                }
                let d = ifv!(l <= hidx[i], hh[hidx[i]]-hh[l], 0);
                dp[i+1][j][hidx[i]] = min(dp[i+1][j][hidx[i]], base+d);

                if j+1 <= k {
                    dp[i+1][j+1][0] = min(dp[i+1][j+1][0], base);
                    dp[i+1][j+1][l] = min(dp[i+1][j+1][l], base);
                }
            }
        }
    }

    let mut best = INF;
    for j in 0..k+1 {
        for l in 0..hn {
            best = min(best, dp[n][j][l]);
        }
    }
    println!("{}", best);
}


Measured memory_bytes: 237820