#![allow(unused_imports, unused_macros, non_snake_case)]
use std::cmp::{max, min, Ordering};
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

//{{{ macros missing in 1.15.1
#[macro_use]
mod macros {
    macro_rules! eprint {
        ($($t:tt)*) => {{
            use ::std::io::Write;
            let _ = write!(::std::io::stderr(), $($t)*);
        }};
    }
    macro_rules! eprintln {
        () => { eprintln!(""); };
        ($($t:tt)*) => {{
            use ::std::io::Write;
            let _ = writeln!(::std::io::stderr(), $($t)*);
        }};
    }
    macro_rules! dbg {
        ($val:expr) => {
            match $val {
                tmp => {
                    eprintln!(
                        "[{}:{}] {} = {:#?}",
                        file!(),
                        line!(),
                        stringify!($val),
                        &tmp
                    );
                    tmp
                }
            }
        };
    }
}
//}}}

fn run() {
    let stdin = std::io::stdin();
    let mut sc = Scanner::new(stdin.lock());
    let n: usize = sc.read();
    let k: usize = sc.read();
    let mut h = vec![0];
    h.extend(sc.read_vec::<usize>(n));
    // (last_idx, count)
    let mut dp = HashMap::new();
    dp.insert((0, 0), 0);
    for i in 0..n {
        let mut next_dp = HashMap::new();
        for (&(last_idx, count), &value) in &dp {
            let n_last_idx = i + 1;
            let n_count = count;
            let n_value = value
                + if h[last_idx] < h[n_last_idx] {
                    h[n_last_idx] - h[last_idx]
                } else {
                    0
                };
            let existing = *next_dp
                .entry((n_last_idx, n_count))
                .or_insert(usize::max_value());
            if existing > n_value {
                next_dp.insert((n_last_idx, n_count), n_value);
            }
        }
        for (&(last_idx, count), &value) in &dp {
            if count == k {
                continue;
            }
            let n_last_idx = last_idx;
            let n_count = count + 1;
            let n_value = value;
            let existing = *next_dp
                .entry((n_last_idx, n_count))
                .or_insert(usize::max_value());
            if existing > n_value {
                next_dp.insert((n_last_idx, n_count), n_value);
            }
        }
        dp = next_dp;
    }
    let mut answer = usize::max_value();
    for (&(last_idx, count), &value) in &dp {
        if answer > value {
            answer = value;
        }
    }
    println!("{}", answer);
}

fn main() {
    std::thread::Builder::new()
        .name("run".to_string())
        .stack_size(1024 * 1024 * 1024)
        .spawn(run)
        .unwrap()
        .join()
        .unwrap()
}

//{{{ Scanner
pub struct Scanner<R> {
    reader: R,
}

impl<R> Scanner<R> {
    pub fn new(r: R) -> Scanner<R> {
        Scanner { reader: r }
    }
}

fn is_whitespace(b: u8) -> bool {
    b == b' ' || b == b'\n' || b == b'\r' || b == b'\t'
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        let buf = std::io::Read::bytes(self.reader.by_ref())
            .map(|b| b.expect("Read failed"))
            .skip_while(|&b| is_whitespace(b))
            .take_while(|&b| !is_whitespace(b))
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error")
    }

    pub fn read_vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn read_chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}
//}}}


Measured memory_bytes: 13768