codeforces 337A

最新推荐文章于 2024-10-31 01:13:03 发布

zsc高凌霄

最新推荐文章于 2024-10-31 01:13:03 发布

阅读量344

点赞数

CC 4.0 BY-SA版权

分类专栏：水题 codeforces 文章标签： codeforces 水题

本文链接：https://blog.youkuaiyun.com/woshigaoniuniu/article/details/51019396

codeforces 同时被 2 个专栏收录

3 篇文章

订阅专栏

水题

1 篇文章

订阅专栏

本文介绍了一个简单的算法问题，即如何为一群孩子从多种不同大小的拼图中选择出差异最小的一组作为礼物。通过排序和遍历的方法，找出连续n个拼图数量间的最小差距。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia states, is a tiling puzzle that requires the assembly of numerous small, often oddly shaped, interlocking and tessellating pieces).

The shop assistant told the teacher that there are m puzzles in the shop, but they might differ in difficulty and size. Specifically, the first jigsaw puzzle consists of f₁ pieces, the second one consists of f₂ pieces and so on.

Ms. Manana doesn't want to upset the children, so she decided that the difference between the numbers of pieces in her presents must be as small as possible. Let A be the number of pieces in the largest puzzle that the teacher buys and B be the number of pieces in the smallest such puzzle. She wants to choose such n puzzles that A - B is minimum possible. Help the teacher and find the least possible value of A - B.

Input

The first line contains space-separated integers n and m (2 ≤ n ≤ m ≤ 50). The second line contains m space-separated integersf₁, f₂, ..., f_m (4 ≤ f_i ≤ 1000) — the quantities of pieces in the puzzles sold in the shop.

Output

Print a single integer — the least possible difference the teacher can obtain.

Sample Input

Input

4 6
10 12 10 7 5 22

Output

Hint

Sample 1. The class has 4 students. The shop sells 6 puzzles. If Ms. Manana buys the first four puzzles consisting of 10, 12, 10 and 7 pieces correspondingly, then the difference between the sizes of the largest and the smallest puzzle will be equal to 5. It is impossible to obtain a smaller difference. Note that the teacher can also buy puzzles 1, 3, 4 and 5 to obtain the difference 5.

水题，排序，最大与最小的肯定是连续的n个

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int INF=0x3f3f3f;
typedef long long LL;
int main()
{
	int n,m;
	int a[1050];
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=m;i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a+1,a+m+1);
		int minv=INF;
		for(int i=1;i<=m-n+1;i++)
		{
			int sum=0;
			int maxn=-1;
			int minx=INF;
			for(int j=i;j<=n+i-1;j++)
			{
				minx=min(minx,a[j]);
				maxn=max(maxn,a[j]);
			}
			minv=min(minv,maxn-minx);
		}
		printf("%d\n",minv);
	}
	return 0;
}