codeforces-scrape

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

1770A.md (2111B)


      1 Source: https://codeforces.com/problemset/problem/1770/A
      2 
      3 A. Koxia and Whiteboards
      4 
      5 time limit per test
      6 
      7 1 second
      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 Kiyora has $n$ whiteboards numbered from $1$ to $n$. Initially, the $i$-th whiteboard has the integer $a_i$ written on it.
     22 
     23 Koxia performs $m$ operations. The $j$-th operation is to choose one of the whiteboards and change the integer written on it to $b_j$.
     24 
     25 Find the maximum possible sum of integers written on the whiteboards after performing all $m$ operations.
     26 
     27 Input
     28 
     29 Each test consists of multiple test cases. The first line contains a single integer $t$ ($1 \leq t \leq 1000$) — the number of test cases. The description of test cases follows.
     30 
     31 The first line of each test case contains two integers $n$ and $m$ ($1 \le n,m \le 100$).
     32 
     33 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$).
     34 
     35 The third line of each test case contains $m$ integers $b_1, b_2, \ldots, b_m$ ($1 \le b_i \le 10^9$).
     36 
     37 Output
     38 
     39 For each test case, output a single integer — the maximum possible sum of integers written on whiteboards after performing all $m$ operations.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 4
     47 
     48 3 2
     49 
     50 1 2 3
     51 
     52 4 5
     53 
     54 2 3
     55 
     56 1 2
     57 
     58 3 4 5
     59 
     60 1 1
     61 
     62 100
     63 
     64 1
     65 
     66 5 3
     67 
     68 1 1 1 1 1
     69 
     70 1000000000 1000000000 1000000000
     71 ```
     72 
     73 Output
     74 
     75 ```
     76 12
     77 9
     78 1
     79 3000000002
     80 ```
     81 
     82 Note
     83 
     84 In the first test case, Koxia can perform the operations as follows:
     85 
     86 1. Choose the $1$-st whiteboard and rewrite the integer written on it to $b_1=4$.
     87 2. Choose the $2$-nd whiteboard and rewrite to $b_2=5$.
     88 
     89 After performing all operations, the numbers on the three whiteboards are $4$, $5$ and $3$ respectively, and their sum is $12$. It can be proven that this is the maximum possible sum achievable.
     90 
     91 In the second test case, Koxia can perform the operations as follows:
     92 
     93 1. Choose the $2$-nd whiteboard and rewrite to $b_1=3$.
     94 2. Choose the $1$-st whiteboard and rewrite to $b_2=4$.
     95 3. Choose the $2$-nd whiteboard and rewrite to $b_3=5$.
     96 
     97 The sum is $4 + 5 = 9$. It can be proven that this is the maximum possible sum achievable.