Warning: session_start(): open(/tmp/sess_3728cf1491ca5d5cb08621e01d60a206, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239

Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
==== CF1379C ==== 有 $m$ 种花，每种花第一次选有 $a_i$ 的快乐值，之后每次有 $b_i$ 的快乐值。要选 $n$ 朵花，并最大化快乐值 直接贪心似乎没什么思路，考虑比较暴力的做法：枚举第 $i$ 种花，把所有 $a_j \ge b_i$ 的其他花先取一次，剩下全部取第 $i$ 种花。 #include #define ALL(x) (x).begin(),(x).end() #define ll long long #define db double #define ull unsigned long long #define pii_ pair #define mp_ make_pair #define pb push_back #define fi first #define se second #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) #define show1(a) cout<<#a<<" = "<