30 lines
839 B
C++
30 lines
839 B
C++
|
#include <bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
const int MAX_N = 10010; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
const int MAX_M = 110; // <20><><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ<EFBFBD><CDB7>
|
|||
|
|
int n, m; // n: ͬѧ<CDAC><D1A7><EFBFBD><EFBFBD>, m: ˮ<><CBAE>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD>
|
|||
|
|
int w[MAX_N]; // ÿλͬѧ<CDAC>Ľ<EFBFBD>ˮ<EFBFBD><CBAE>
|
|||
|
|
int taps[MAX_M]; // ÿ<><C3BF>ˮ<EFBFBD><CBAE>ͷ<EFBFBD>ĵ<EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>
|
|||
|
|
int main() {
|
|||
|
|
cin >> n >> m;
|
|||
|
|
|
|||
|
|
// ģ<><C4A3><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE><EFBFBD><EFBFBD>
|
|||
|
|
for (int i = 0; i < n; i++) {
|
|||
|
|
cin >> w[i];
|
|||
|
|
|
|||
|
|
// <20>ҵ<EFBFBD><D2B5><EFBFBD><EFBFBD>Ƚ<EFBFBD><C8BD><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ
|
|||
|
|
int min_tap = 0;
|
|||
|
|
for (int j = 1; j < m; j++)
|
|||
|
|
if (taps[j] < taps[min_tap])
|
|||
|
|
min_tap = j;
|
|||
|
|
// <20><>i<EFBFBD><69>ͬѧ<CDAC>Ľ<EFBFBD>ˮ<EFBFBD><CBAE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƚ<EFBFBD><C8BD><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ
|
|||
|
|
taps[min_tap] += w[i];
|
|||
|
|
}
|
|||
|
|
// <20>ҵ<EFBFBD><D2B5><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ľ<EFBFBD><C4BD><EFBFBD>ʱ<EFBFBD><CAB1>
|
|||
|
|
int result = 0;
|
|||
|
|
for (int i = 0; i < m; i++)
|
|||
|
|
result = max(result, taps[i]);
|
|||
|
|
|
|||
|
|
cout << result << endl;
|
|||
|
|
return 0;
|
|||
|
|
}
|