codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1374E1.md (2445B)


      1 Source: https://codeforces.com/problemset/problem/1374/E1
      2 
      3 E1. Reading Books (easy version)
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
     22 
     23 Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they have to read some amount of books before all entertainments. Alice and Bob will read each book together to end this exercise faster.
     24 
     25 There are $n$ books in the family library. The $i$-th book is described by three integers: $t_i$ — the amount of time Alice and Bob need to spend to read it, $a_i$ (equals $1$ if Alice likes the $i$-th book and $0$ if not), and $b_i$ (equals $1$ if Bob likes the $i$-th book and $0$ if not).
     26 
     27 So they need to choose some books from the given $n$ books in such a way that:
     28 
     29 * Alice likes at least $k$ books from the chosen set and Bob likes at least $k$ books from the chosen set;
     30 * the total reading time of these books is minimized (they are children and want to play and joy as soon a possible).
     31 
     32 The set they choose is the same for both Alice an Bob (it's shared between them) and they read all books together, so the total reading time is the sum of $t_i$ over all books that are in the chosen set.
     33 
     34 Your task is to help them and find any suitable set of books or determine that it is impossible to find such a set.
     35 
     36 Input
     37 
     38 The first line of the input contains two integers $n$ and $k$ ($1 \le k \le n \le 2 \cdot 10^5$).
     39 
     40 The next $n$ lines contain descriptions of books, one description per line: the $i$-th line contains three integers $t_i$, $a_i$ and $b_i$ ($1 \le t_i \le 10^4$, $0 \le a_i, b_i \le 1$), where:
     41 
     42 * $t_i$ — the amount of time required for reading the $i$-th book;
     43 * $a_i$ equals $1$ if Alice likes the $i$-th book and $0$ otherwise;
     44 * $b_i$ equals $1$ if Bob likes the $i$-th book and $0$ otherwise.
     45 
     46 Output
     47 
     48 If there is no solution, print only one integer -1. Otherwise print one integer $T$ — the minimum total reading time of the suitable set of books.
     49 
     50 Examples
     51 
     52 Input
     53 
     54 ```
     55 8 4  
     56 7 1 1  
     57 2 1 1  
     58 4 0 1  
     59 8 1 1  
     60 1 0 1  
     61 1 1 1  
     62 1 0 1  
     63 3 0 0
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 18
     70 ```
     71 
     72 Input
     73 
     74 ```
     75 5 2  
     76 6 0 0  
     77 9 0 0  
     78 1 0 1  
     79 2 1 1  
     80 5 1 0
     81 ```
     82 
     83 Output
     84 
     85 ```
     86 8
     87 ```
     88 
     89 Input
     90 
     91 ```
     92 5 3  
     93 3 0 0  
     94 2 1 0  
     95 3 1 0  
     96 5 0 1  
     97 3 0 1
     98 ```
     99 
    100 Output
    101 
    102 ```
    103 -1
    104 ```