A. Rudolf and the Ticket

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Rudolf is going to visit Bernard, and he decided to take the metro to get to him. The ticket can be purchased at a machine that accepts exactly two coins, the sum of which does not exceed k�.

Rudolf has two pockets with coins. In the left pocket, there are n� coins with denominations b1,b2,...,bn�1,�2,...,��. In the right pocket, there are m� coins with denominations c1,c2,...,cm�1,�2,...,��. He wants to choose exactly one coin from the left pocket and exactly one coin from the right pocket (two coins in total).

Help Rudolf determine how many ways there are to select indices f� and s� such that bf+cs≤k��+��≤�.

Input

The first line contains an integer t� (1≤t≤1001≤�≤100) --- the number of test cases. Then follows the description of each test case.

The first line of each test case contains three natural numbers n�, m�, and k� (1≤n,m≤100,1≤k≤20001≤�,�≤100,1≤�≤2000) --- the number of coins in the left and right pockets, and the maximum sum of two coins for the ticket payment at the counter, respectively.

The second line of each test case contains n� integers bi�� (1≤bi≤10001≤��≤1000) --- the denominations of coins in the left pocket.

The third line of each test case contains m� integers ci�� (1≤ci≤10001≤��≤1000) --- the denominations of coins in the right pocket.

Output

For each testcase, output a single integer --- the number of ways Rudolf can select two coins, taking one from each pocket, so that the sum of the coins does not exceed k�.

Example

input

Copy

复制代码

4

4 4 8

1 5 10 14

2 1 8 1

2 3 4

4 8

1 2 3

4 2 7

1 1 1 1

2 7

3 4 2000

1 1 1

1 1 1 1

output

Copy

复制代码
6
0
4
12

Note

Note that the pairs indicate the indices of the coins in the array, not their denominations.

In the first test case, Rudolf can choose the following pairs of coins: [1,1],[1,2],[1,4],[2,1],[2,2],[2,4][1,1],[1,2],[1,4],[2,1],[2,2],[2,4].

In the second test case, Rudolf cannot choose one coin from each pocket in any way, as the sum of any two elements from the first and second arrays will exceed the value of k=4�=4.

In the third test case, Rudolf can choose: [1,1],[2,1],[3,1],[4,1][1,1],[2,1],[3,1],[4,1].

In the fourth test case, Rudolf can choose any coin from the left pocket and any coin from the right pocket.

解题说明:水题,两个数列每次取一个数相加,遍历判断是否小于k即可。

cpp 复制代码
#include<stdio.h>
int main() 
{
	int p;
	scanf("%d", &p);
	while (p--) 
	{
		int n, m, k, count = 0;
		scanf("%d%d%d", &n, &m, &k);
		int a[102], b[102];
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
		}
		for (int i = 0; i < m; i++)
		{
			scanf("%d", &b[i]);
		}
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++) 
			{
				if (a[i] + b[j] <= k)
				{
					count++;
				}
			}
		}
		printf("%d\n", count);
	}
	return 0;
}
相关推荐
bkspiderx1 小时前
C++经典的数据结构与算法之经典算法思想:贪心算法(Greedy)
数据结构·c++·算法·贪心算法
中华小当家呐2 小时前
算法之常见八大排序
数据结构·算法·排序算法
沐怡旸3 小时前
【算法--链表】114.二叉树展开为链表--通俗讲解
算法·面试
一只懒洋洋3 小时前
K-meas 聚类、KNN算法、决策树、随机森林
算法·决策树·聚类
方案开发PCBA抄板芯片解密4 小时前
什么是算法:高效解决问题的逻辑框架
算法
songx_995 小时前
leetcode9(跳跃游戏)
数据结构·算法·游戏
小白狮ww5 小时前
RStudio 教程:以抑郁量表测评数据分析为例
人工智能·算法·机器学习
AAA修煤气灶刘哥5 小时前
接口又被冲崩了?Sentinel 这 4 种限流算法,帮你守住后端『流量安全阀』
后端·算法·spring cloud
kk”6 小时前
C语言快速排序
数据结构·算法·排序算法
纪元A梦6 小时前
贪心算法应用:基因编辑靶点选择问题详解
算法·贪心算法