hdu 5777 domino （贪心）

domino

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 352    Accepted Submission(s): 190

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

 

Source

BestCoder Round #85

解题思路：要让多米诺骨牌的总高度最小，就利用k次出手的机会，避免掉k-1个最大距离，所以只用排个序，选一下前n-k个数，注意最后答案用longlong存一下就好了~

#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int a[100005];typedef long long ll;int main(){    int t,n,k,i;    cin>>t;    while(t--)    {        cin>>n>>k;        ll sum = 0;        for(i=0;i<n-1;i++)        {            cin>>a[i];        }        sort(a,a+n-1);        for(i=0;i<n-k;i++)            sum += a[i];        sum += n;        cout << sum << endl;    }    //cout << "Hello world!" << endl;    return 0;}