New update is available. Click here to update.

Last Updated: 25 May, 2021

Difficulty: Moderate

```
The first line of input contains an integer ‘T’, denoting the number of test cases. Then the test cases follow.
The first line of each test case contains three space-separated integers, ‘N’, ‘M’ and ‘K’, denoting the number of downloads and games and the total memory available, respectively.
The second line of each test case contains ‘N’ space-separated integers denoting the memory usages of downloads in the array ‘download’.
The third line of each test case contains ‘M’ space-separated integers denoting the memory usages of games in the array ‘game’.
```

```
For each test case, print an array ‘result’, denoting the pairs of downloads and games for maximum memory usage in the following format.
result[i] = [ind1, ind2], where ind1 is the index of the download chosen and ind2 is the index of the game selected. If only one game or one download is chosen, put the other index as ‘-1’. In case no options are available, print ‘-1 -1’.
```

```
You are not required to print the expected output. It has already been taken care of. Just implement the function.
```

```
1 <= T <= 10
1 <= N, M <= 10^5
1 <= K <= 10^9
1 <= game[i], download[i] <= 10^6
Time Limit: 1 sec
```

SIMILAR PROBLEMS

Find minimum

Posted: 8 Nov, 2022

Difficulty: Hard

Merge Two Sorted Arrays Without Extra Space

Posted: 19 Nov, 2022

Difficulty: Moderate

Search In A Sorted 2D Matrix

Posted: 23 Nov, 2022

Difficulty: Moderate

Sort 0s, 1s, 2s

Posted: 24 Dec, 2022

Difficulty: Easy

Fake Coin Problem

Posted: 24 Dec, 2022

Difficulty: Easy

Popular Interview Problems: