B. Polycarp's Practice

B. Polycarp's Practice

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

 

 

Polycarp is practicing his problem solving skill. He has a list of n problems with difficulties a1,a2,…,an, respectively. His plan is to practice for exactly k days. Each day he has to solve at least one problem from his list. Polycarp solves the problems in the order they are given in his list, he cannot skip any problem from his list. He has to solve all n problems in exactly k

days.

Thus, each day Polycarp solves a contiguous sequence of (consecutive) problems from the start of the list. He can't skip problems or solve them multiple times. As a result, in k

days he will solve all the n

problems.

The profit of the j

-th day of Polycarp's practice is the maximum among all the difficulties of problems Polycarp solves during the j-th day (i.e. if he solves problems with indices from l to r during a day, then the profit of the day is maxl≤i≤rai). The total profit of his practice is the sum of the profits over all k

days of his practice.

You want to help Polycarp to get the maximum possible total profit over all valid ways to solve problems. Your task is to distribute all n

problems between k

days satisfying the conditions above in such a way, that the total profit is maximum.

For example, if n=8,k=3

and a=[5,4,2,6,5,1,9,2], one of the possible distributions with maximum total profit is: [5,4,2],[6,5],[1,9,2]. Here the total profit equals 5+6+9=20

.

Input

The first line of the input contains two integers n

and k (1≤k≤n≤2000

) — the number of problems and the number of days, respectively.

The second line of the input contains n

integers a1,a2,…,an (1≤ai≤2000

) — difficulties of problems in Polycarp's list, in the order they are placed in the list (i.e. in the order Polycarp will solve them).

Output

In the first line of the output print the maximum possible total profit.

In the second line print exactly k

positive integers t1,t2,…,tk (t1+t2+⋯+tk must equal n), where tj means the number of problems Polycarp will solve during the j

-th day in order to achieve the maximum possible total profit of his practice.

If there are many possible answers, you may print any of them.

Examples

Input

8 3
5 4 2 6 5 1 9 2

Output

20
3 2 3

Input

5 1
1 1 1 1 1

Output

1
5

Input

 

4 2
1 2000 2000 2

Output

 

4000
2 2

Note

The first example is described in the problem statement.

In the second example there is only one possible distribution.

In the third example the best answer is to distribute problems in the following way: [1,2000],[2000,2]

. The total profit of this distribution is 2000+2000=4000.

 

 先把数据存在一个数组啊a[]里，再赋值给b数组，然后把b排序，找出最大的k个数

加起来就是输出的和

再在a里找这几个最大的数

记录下它的位置，然后后一个的位置减去前一个的位置就是那段长度

要注意的是第一个值和最后一个值的位置输出的时候要特殊考虑下就行

 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    int n,k,a[2009],b[2009];
    int sum;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        sum=0;
        int t=0;
        int ss=0;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(int i=0; i<n; i++)
        {
            cin>>b[i];
            a[i]=b[i];
        }
        sort(a,a+n);
        for(int i=n-1;; i--)
        {
            if(i==n-1-k)
                break;
            sum+=a[i];
        }
        cout<<sum<<endl;
        for(int i=0; i<n; i++)
        {
            for(int j=n-1; j>n-1-k; j--)
            {
                if(b[i]==a[j])
                {
                    t++;
                    a[j]=-1;
                    if(t>1)
                    {
                        cout<<i-ss<<" ";
                        ss=i;
                    }
                    break;
                }
            }
        }
        cout<<n-ss<<endl;
    }
    return 0;
}