Water connection problem

Title Description

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

The quantity of water supply is equal to 1.

Now there are n students ready to pick up water, and their initial water order has been determined. These students according to water order from 1 to n number, I number of students of the water intake 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 to receive the water, 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/output format

Input format:

The input file name is water.in.

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 each two integers, WI indicates the number I

The amount of water to learn.

Output format:

The output file name is Water.out.

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

Input and Output Sample input example # #:

Sample # # of output:

"Output Sample 1" 4 "output Example 2" 163

Description

"Input and Output Example 1 description"

The 1th second, 3 people connect water. At the end of the 1th second, 1, 2, 3rd students each have received water of 1, 3rd students to finish

Water, 4th students to replace 3rd students began to pick up 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 been connected

Water volume is 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 been connected

Water volume is 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 been connected

Water volume is 1. 1, 2, 5th students after the water, that is, all the water to complete.

The total water connection time is 4 seconds.

"Data Range"

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

1≤wi≤100.

Ideas:

This problem embodies the idea of simulation, respectively, let the former M personal water, and then after a person has finished, w++, let the first m+w personal fill up

#include <iostream>#include<cstdio>#include<cstring>using namespacestd;intn,m,j,w=0;//a few people have finished the water.inta[10005];//Open ArrayintMain () {scanf ("%d%d",&n,&m);  for(intI=0; i<n;i++) scanf ("%d",&A[i]);  for(intI=1; m+w<n;i++)//The person who has finished the water and the person who is receiving water is less or equal to the total number, enumerating every minute{J=0;  while(1)        {//Find out if there are any people who are receiving water.            if(a[j]==i) {a[j]+=a[m+w];w++;}//and then let the latter be added .            if(j==m-1) Break;//the platoon doesn't quit .J + +; }} sort (A,a+N); printf ("%d", a[n-1]); return 0;}

Water connection problem