zoukankan      html  css  js  c++  java
  • acm寒假特辑 1月17日 CodeForces

    D - 4 CodeForces - 337A

    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
    The first line contains space-separated integers n and m (2 ≤ n ≤ m ≤ 50). The second line contains m space-separated integers f1, f2, …, fm (4 ≤ fi ≤ 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.

    Examples
    Input
    4 6
    10 12 10 7 5 22
    Output
    5
    Note
    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个礼物中选出最大与最小差异最小的数值。

    思路:求差异的话,先把数字排好,然后比较i与i+n个的差异,找出最小值。

    //miku saiko
    #include<iostream>
    using namespace std;
    int main()
    {
    	int n, m, a[1005], temp, x, min=10000;
    	cin >> n >> m;
    	for (int i = 0 ;i<m; i++)
    	{
    		cin >> a[i];
    	}
    	for (int i=0;i<m;i++)
    	{
    		for (int j=0;j<m-1;j++)
    		{
    			if (a[j]<a[j+1])
    			{
    				temp = a[j];
    				a[j] = a[j + 1];
    				a[j + 1] = temp;
    			}
    		}
    	}
    	for (int i=0;(i+n-1)<m;i++)
    	{
    		x = a[i] - a[i + n - 1];
    		if (x < min)
    			min = x;
    	}
    	cout << min << endl;
        return 0;
    }
    
  • 相关阅读:
    线程(C++11)
    初始化、赋值
    优质学习资料总结
    移植之乱谈
    采集音频和摄像头视频并实时H264编码及AAC编码
    H264解码器源码(Android 1.6 版)
    移植ffmpeg到VC环境心得
    收集的网络上大型的开源图像处理软件代码(提供下载链接)
    C++开源库,欢迎补充。
    一个轻量级AOP的实现(开源)
  • 原文地址:https://www.cnblogs.com/gidear/p/10433287.html
Copyright © 2011-2022 走看看