// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
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)*}
    };
}

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)*}
    };
}

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, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        m: usize,
        p: [i32; n],
        op: [(usize1, i32); m],
    }
    let mut p = p;
    p.sort_by_key(|p| -*p);
    let mut a = vec![vec![]; 2];
    for (t, x) in op {
        a[t].push(x);
    }
    a[0].sort_by_key(|x| -*x);
    a[1].sort_by_key(|x| -*x);
    let h = a[0].len();
    let w = a[1].len();
    let mut dp = vec![0; w + 1];
    let mut max = 0;
    for i in 0..=h {
        let mut next = vec![0; w + 1];
        for j in 0..=w {
            if i + j >= n {
                continue;
            }
            let v = dp[j];
            if i < h {
                next[j].chmax(v + p[i + j].min(a[0][i]));
            }
            if j < w {
                dp[j + 1].chmax(v + p[i + j] * a[1][j] / 100);
            }
        }
        max.chmax(dp.into_iter().max().unwrap());
        dp = next;
    }
    let ans = p.into_iter().sum::<i32>() - max;
    println!("{}", ans);
}

fn main() {
    run();
}