hdu 5777 domino

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

14 22 3 4

 

Sample Output

9
排序，放出k次最大距离，剩余的距离和加上每个骨牌基础1高度既是结果；
#include<stdio.h>#include<algorithm>#include<iostream>using namespace std;int a[100050];int main(){    int T,n,k;    scanf("%d",&T);    while(T--){       scanf("%d%d",&n,&k);       for(int i=0;i<n-1;i++)        scanf("%d",&a[i]);       sort(a,a+n-1);       __int64 ans=0;       //for(int i=0;i<n-1;i++) printf("%d ",a[i]);       for(int i=0;i<n-k;i++)         ans+=a[i];       printf("%I64d\n",ans+n);    }}