• Codeforces Round #527-B. Teams Forming(贪心)


    time limit per test

    1 second

    memory limit per test

    256 megabytes

    input

    standard input

    output

    standard output

    There are nn students in a university. The number of students is even. The ii-th student has programming skill equal to aiai.

    The coach wants to form n2n2 teams. Each team should consist of exactly two students, and each student should belong to exactly one team. Two students can form a team only if their skills are equal (otherwise they cannot understand each other and cannot form a team).

    Students can solve problems to increase their skill. One solved problem increases the skill by one.

    The coach wants to know the minimum total number of problems students should solve to form exactly n2n2 teams (i.e. each pair of students should form a team). Your task is to find this number.

    Input

    The first line of the input contains one integer nn (2≤n≤100) — the number of students. It is guaranteed that nn is even.

    The second line of the input contains nn integers a1,a2,…,an (1≤ai≤100), where ai is the skill of the ii-th student.

    Output

    Print one number — the minimum total number of problems students should solve to form exactly n2n2 teams.

    Examples

    input

    Copy

    6
    5 10 2 3 14 5
    

    output

    Copy

    5
    

    input

    Copy

    2
    1 100
    

    output

    Copy

    99
    

    Note

    In the first example the optimal teams will be: (3,4)(3,4), (1,6)(1,6) and (2,5)(2,5), where numbers in brackets are indices of students. Then, to form the first team the third student should solve 11 problem, to form the second team nobody needs to solve problems and to form the third team the second student should solve 44 problems so the answer is 1+4=5.

    In the second example the first student should solve 9999 problems to form a team with the second one.

    题解:

    这个题比第一题还水,求几个人需要做多少题才能一样,肯定就是排好序的从小到大,两个相邻的差值最小,这样最后的和才会最小

    代码:

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    
    using namespace std;
    
    int main()
    {
    	int n;
    	cin>>n;
    	int sum=0;
    	int a[105];
    	for(int t=0;t<n;t++)
    	{
    		scanf("%d",&a[t]);
    	}
    	sort(a,a+n);
    	for(int t=0;t<n;t+=2)
    	{
    		sum+=a[t+1]-a[t];
    	}
    	cout<<sum<<endl;
    	return 0;
     } 
  • 相关阅读:
    BZOJ 4886 Lydsy1705月赛 叠塔游戏
    BZOJ 4552 TJOI2016&&HEOI2016 排序
    BZOJ 3702 二叉树
    BZOJ 4756 Usaco2017 Jan Promotion Counting
    BZOJ 4842 Neerc2016 Delight for a Cat
    BZOJ 1283 序列
    BZOJ 4819 SDOI2017 新生舞会
    BZOJ 1531 POI2005 Bank notes
    BZOJ 1925 SDOI2010 地精部落
    BZOJ WC2006 水管局长数据加强版
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781896.html
Copyright © 2020-2023  润新知