1.9.15

15: Water Connection problem

Total time limit:

1000ms

Memory Limit:

65536kB

Describe

There is a water room in the school, the water room is equipped with a total of M a faucet for students to open water, each faucet per second of the same amount of water, are 1.

Now there are n students ready to pick up water, and their initial water order has been determined. The students according to water order from 1 to n number, I number of students of the water supply is wI. When the water starts, 1 to m students each occupy a faucet, and at the same time turn on the tap to connect water. When one of the students J finished their water demand WJ , the next line of students waiting for water to meet K immediately take over the position of J classmate began to connect water. The process of substitution is instantaneous, without any waste of water. That is, J classmate at the end of the first X seconds to complete the water, then K classmate x+1 seconds immediately began to pick up water. If the current number of water access n ' less than m, then only n ' Faucet water supply, the other m-n ' faucet closed.

Now give the water intake of n students, according to the above water rules, ask all the students how many seconds to finish the water.

Input

Line 1th 2 integers n and m, separated by a space, respectively, indicating the number of water and faucet.
Line 2nd n integers W1, w2 、......、 Wn, separated by a space between every two integers, WI indicates the water intake of the student I.

1≤n≤10000,1≤m≤100 and M≤n;
1≤wi≤100.

Output

The

output is only one row, 1 integers, indicating the total time required to receive water.

Sample input

Example #1:5 34 4 1 2 1 Sample #2:8 423 71 87 32 70 93 80 76

Sample output

Example #1:4 Sample #2:163

Tips

input and Output Example 1 explanation:
The 1th second, 3 people connect water. At the end of the 1th second, 1, 2, 3rd, each of the students have received water for 1, 3rd students to finish, 4th students to replace the 3rd students began to connect water.
The 2nd second, 3 people connect water. At the end of the 2nd second, 1, 2nd students each have received water of 2, 4th students have received water of 1.
The 3rd second, 3 people connect water. At the end of the 3rd second, 1, 2nd students each have received water of 3, 4th students have received water of 2. 4th students after the water, No. 5th students to replace the 4th students began to connect water.
The 4th second, 3 people connect water. At the end of the 4th second, 1, 2nd students each have received water of 4, 5th students have received water of 1. 1, 2, 5th students after the water, that is, all the water to complete.
The total water connection time is 4 seconds.

Source

The

second problem of popularization group of NOIP2010 semi-finals

1#include <cstdio>2#include <cstring>3 using namespacestd;4 intMain ()5 {6     intn,m,shu=0, x=0;7scanf"%d%d",&n,&m);8     intw[n],w1[n],t=0, z=m;9      for(intI=0; i<n;i++)Ten     { Onescanf"%d",&w[i]); Ax+=W[i]; -     } -memset (W1,0,sizeof(W1)); the      for(intI=0; i<m;i++) -w1[i]=W[i]; -      while(1) -     { +          for(intI=0; i<m;i++) -         { +             if(w1[i]-1>=0) A         { atw1[i]--; -shu++; -         } -             Else -             { -                  in                 if(z<N) -                 { tow1[i]=w[z],z++; +w1[i]--; -shu++; the                 } *                  $             }Panax Notoginseng                          -         } thet++; +         if(shu==x) A          Break; the     } +      -printf"%d", T); $     return 0; $}

1.9.15