研发笔试第二题 #include<bits/stdc++.h> using namespace std; int main() { int K, N = 0; int g_i = 0; int count = 0; cin >> N >> K; vector<int>g; while (N--) { cin >> g_i; g.push_back(g_i); } sort(g.rbegin(), g.rend()); while (g[K - 1] > 0) { for (int i = 0; i < K; i++) { g[i] -= 1; } count++; sort(g.rbegin(), g.rend()); } cout << count; system("pause"); return 0; }