fn main() { input! { n: usize, m: usize, e: [i32; n], p: [(i32, i32); m], } let mut ord = (0..n).collect::>(); ord.sort_by_key(|x| e[*x]); let e = ord.iter().map(|x| e[*x]).collect::>(); let pos = p .iter() .map(|p| e.iter().position(|e| *e >= p.1).unwrap_or(n)) .collect::>(); let mut dp = vec![(n, 0); 1 << m]; dp[0] = (0, 0); let mut ans = (0, 0); for i in 0..(1 << m) { let v = dp[i]; if v.0 == n { continue; } let mut sum = 0; for (j, (p, &pos)) in p.iter().zip(pos.iter()).enumerate() { if i >> j & 1 == 1 { sum += p.0; } else if v.1 + p.1 <= e[v.0] { dp[i | (1 << j)].chmin((v.0, v.1 + p.1)); } else { let k = (v.0 + 1).max(pos); if k < n { dp[i | (1 << j)].chmin((k, p.1)); } } } ans.chmax((sum, i)); } let mut list = vec![vec![]; n]; while ans.1 > 0 { let now = dp[ans.1]; for (j, &p) in p.iter().enumerate() { if ans.1 >> j & 1 == 0 { continue; } let pre = dp[ans.1 ^ (1 << j)]; if now.1 >= p.1 && (pre.0, pre.1 + p.1) <= now { list[now.0].push(j); ans.1 ^= 1 << j; break; } } } let mut iord = vec![0; n]; for (i, ord) in ord.iter().enumerate() { iord[*ord] = i; } println!("{}", ans.0); for (i, &k) in iord.iter().enumerate() { let list = &list[k]; if list.is_empty() { println!("0"); } else { let s = list.iter().map(|x| p[*x].1).sum::(); assert!(s <= e[k]); use util::*; println!("{} {}", list.len(), list.iter().map(|v| *v + 1).join(" ")); } } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] 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_export] 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_export] 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::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl 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 ---------- mod util { pub trait Join { fn join(self, sep: &str) -> String; } impl Join for I where I: Iterator, T: std::fmt::Display, { fn join(self, sep: &str) -> String { let mut s = String::new(); use std::fmt::*; for (i, v) in self.enumerate() { if i > 0 { write!(&mut s, "{}", sep).ok(); } write!(&mut s, "{}", v).ok(); } s } } }