“玲珑杯”ACM比赛 Round #1 题解

A:DESCRIPTION

Eric has an array of integers ${\mathrm{a1,a2,...,ana1,a2,...,an.\; Every\; time,\; he\; can\; choose\; a\; contiguous\; subsequence\; of\; length\; kk\; and\; increase\; every\; integer\; in\; the\; contiguous\; subsequence\; by\; 11.\; He\; wants\; the\; minimum\; value\; of\; the\; array\; is\; at\; least\; mm.\; Help\; him\; find\; the\; minimum\; number\; of\; operations\; needed.}}^{}$

INPUT

There are multiple test cases. The first line of input contains an integer $\mathrm{TT,\; indicating\; the\; number\; of\; test\; cases.\; For\; each\; test\; case:\; The\; first\; line\; contains\; three\; integers\; nn,\; mm\; and\; kk\; (1\le n\le 105,1\le k\le n,1\le m\le 104)(1\le n\le 105,1\le k\le n,1\le m\le 104).\; The\; second\; line\; contains\; nn\; integers\; a1,a2,...,ana1,a2,...,an\; (1\le ai\le 104)(1\le ai\le 104).}$

OUTPUT

For each test case, output an integer denoting the minimum number of operations needed.

SAMPLE INPUT
3
2 2 2
1 1
5 1 4
1 2 3 4 5
4 10 3
1 2 3 4
SAMPLE OUTPUT
1
0
15

题目链接:http://ifrog.cc/acm/problem/1014?contest=1001&no=0

*************************************

错误代码：（貌似错的还挺离谱，没办法，太弱了）

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
#include<time.h>
#include<stack>
using namespace std;
#define N 120000
#define INF 0x3f3f3f3f

int a[N];

int main()
{
    int T,n,m,k,i;

    scanf("%d", &T);

    while(T--)
    {
        scanf("%d %d %d", &n,&m,&k);

        for(i=0; i<n; i++)
            scanf("%d", &a[i]);

        sort(a,a+n);

        int i=0,sum=0;
        while(i<n)
        {
            if(m-a[i]>0)
                sum+=m-a[i];
            i+=k;
        }
        printf("%d
",sum);
    }

    return 0;
}

 比赛全部的题从链接里面找，有兴趣的可以自己做做看。下面是全部题解：