Codeforces Round #196 (Div. 2) A. Puzzles 水题
A. Puzzles
Time Limit: 2 Sec Memory Limit: 60 MB
题目连接
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5373
Description
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 f1 pieces, the second one consists of f2 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
Output
Sample Input
4 6
10 12 10 7 5 22
Sample 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个数,然后让你选M个,让这M个数中的最大值减去最小值的这个值,最小
问这个最小值是多少
题解:
拍一下序,然后暴力搞一搞就好
代码:
//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 2001
#define mod 10007
#define eps 1e-9
//const int inf=0x7fffffff; //无限大
const int inf=0x3f3f3f3f;
/* */
//**************************************************************************************
inline ll read()
{
int x=,f=;char ch=getchar();
while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
return x*f;
}
int a[maxn];
bool cmp(int c,int d)
{
return c>d;
}
int main()
{
int n=read(),m=read();
for(int i=;i<m;i++)
a[i]=read();
int mi=inf;
sort(a,a+m,cmp);
for(int i=;i+n-<m;i++)
mi=min(a[i]-a[i+n-],mi);
printf("%d\n",mi);
}
最新文章
- zabbix3.x web设置手册(2)
- (转)IIS设置优化(需根据服务器性能,调整具体参数值)
- poj 1742 Coins
- Linux查看磁盘块大小
- C文件函数总结
- eclipse for mac 快捷键
- PHPExcel生成或读取excel文件
- spring cloud 入门系列六:使用Zuul 实现API网关服务
- webpack打包优化之外部扩展externals的实际应用
- python自动化开发-[第三天]-编码,函数,文件操作
- 看淘宝营销api 文档有感
- C# 操作符 <;<; 与 >;>;
- 一个linux内核编译时遇到的perl语法导致的编译问题解决
- 按装 autoconf 出现 需要安装m4-1.4.16.tar.gz的错误
- SpringBatch的初步了解
- 用JavaScript来生成HTML
- day 08 函数
- 作业调度系统quartz.net
- Swift图书展示项目笔记
- HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm