[Solution] Schedule Management Codeforces Solution

C. Schedule Management

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n$n$ workers and m$m$ tasks. The workers are numbered from 1$1$ to n$n$. Each task i$i$ has a value ai$a_i$ — the index of worker who is proficient in this task.

Every task should have a worker assigned to it. If a worker is proficient in the task, they complete it in 1$1$ hour. Otherwise, it takes them 2$2$ hours.

The workers work in parallel, independently of each other. Each worker can only work on one task at once.

Assign the workers to all tasks in such a way that the tasks are completed as early as possible. The work

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 starts at time 0$0$. What's the minimum time all tasks can be completed by?

Input

The first line contains a single integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of testcases.

Grass Field Codeforces Solution

Permutation Codeforces Solution

Schedule Management Codeforces Solution

Permutation Restoration Codeforces Solution

Text Editor Codeforces Solution

Points Codeforces Solution 

The first line of each testcase contains two integers n$n$ and m$m$ (1≤n≤m≤2⋅105$1\le n\le m\le 2\cdot {10}^5$) — the number of workers and the number of tasks.

The second line contains m$m$ integers a1,a2,…,am$a_1,a_2,\dots ,a_m$ (1≤ai≤n$1\le a_i\le n$) — the index of the worker proficient in the i$i$-th task.

The sum of m$m$ over all testcases doesn't exceed 2⋅105$2\cdot {10}^5$.

Output

For each testcase, print a single integer — the minimum time all tasks can be completed by.