301643: CF313E. Ilya and Two Numbers

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Ilya and Two Numbers

题意翻译

给定长度为 $N$ 的两个数组 $A$ 和 $B$,对两个数组的元素执行任意顺序的重排列后,按 $C_i=(A_i+B_i)\bmod M$ 求得新数组 $C$。问字典序最大的 $C$ 是什么。

题目描述

Ilya has recently taken up archaeology. He's recently found two numbers, written in the $ m $ -based notation. Each of the found numbers consisted of exactly $ n $ digits. Ilya immediately started looking for information about those numbers. He learned that the numbers are part of a cyphered code and the one who can decypher it can get the greatest treasure. After considerable research Ilya understood that to decypher the code, he should do the following: - Rearrange digits in the first number in some manner. Similarly, rearrange digits in the second number in some manner. As a result of this operation, the numbers can get leading zeroes. - Add numbers, digit by digit, modulo $ m $ . In other words, we need to get the third number of length $ n $ , each digit of the number is the sum of the respective numbers of the found numbers. For example, suppose there are two numbers recorded in the ternary notation, 001210 and 012111, then if you add them to each other digit by digit modulo 3, you will get number 010021. - The key to the code is the maximum possible number that can be obtained in the previous step. Help Ilya, find the key to the code.

输入输出格式

输入格式


The first line contains two integers $ n,m $ $ (1<=n,m<=10^{5},m&gt;1) $ . The second line contains the first found number, the third line contains the second found number. The numbers are recorded as a sequence of digits in the $ m $ -based notation. Each digit is an integer from 0 to $ m-1 $ . The digits in the line are written in the order from the most significant digits to the least significant ones. The given numbers can contain leading zeroes.

输出格式


Print $ n $ $ m $ -base digits. The resulting third number written in the $ m $ -based notation. Print the digits in the order from the most significant digits to the least significant ones.

输入输出样例

输入样例 #1

4 7
5 4 3 2
5 6 5 4

输出样例 #1

6 4 2 1 

输入样例 #2

5 5
2 4 4 1 3
1 0 1 2 4

输出样例 #2

4 4 4 3 2 

Input

题意翻译

给定长度为 $N$ 的两个数组 $A$ 和 $B$,对两个数组的元素执行任意顺序的重排列后,按 $C_i=(A_i+B_i)\bmod M$ 求得新数组 $C$。问字典序最大的 $C$ 是什么。

加入题单

算法标签: