HDU 5777 domino

最新推荐文章于 2019-12-05 18:07:23 发布

处变不惊

最新推荐文章于 2019-12-05 18:07:23 发布

阅读量407

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM试题

本文链接：https://blog.youkuaiyun.com/zyq_19960204/article/details/52075879

ACM试题专栏收录该内容

104 篇文章

订阅专栏

本文介绍了一个关于排列骨牌的游戏问题，玩家需要通过有限次操作使所有骨牌倒下，并尽量减少骨牌高度总和。文章提供了输入输出示例及完整的C++代码实现。

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

Problem Description
Little White plays a game.There are n pieces of dominoes on the table in a row. He can choose a domino which hasn't fall down for at most k times, let it fall to the left or right. When a domino is toppled, it will knock down the erect domino. On the assumption that all of the tiles are fallen in the end, he can set the height of all dominoes, but he wants to minimize the sum of all dominoes height. The height of every domino is an integer and at least 1.

Input
The first line of input is an integer T ( 1≤T≤10)
There are two lines of each test case.
The first line has two integer n and k, respectively domino number and the number of opportunities.( 2≤k,n≤100000)
The second line has n - 1 integers, the distance of adjacent domino d, 1≤d≤100000

Output
For each testcase, output of a line, the smallest sum of all dominoes height

Sample Input
1
4 2
2 3 4

Sample Output
9

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<climits>
#include<stack>
#include<queue>
#include<map>
#include<vector>
using namespace std;
#define ll long long
const int N=100002;
const int M=5005;
int d[N];
int main()
{
    int t,n,k,i,j;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&k);
        ll sum=n;
        for (i=1;i<n;i++)
            scanf("%d",&d[i]);
        sort(d+1,d+n);
        for (i=1;i+k-1<n;i++)
            sum+=d[i];
        printf("%lld\n",sum);
    }
    return 0;
}