1 solutions
-
0
C++ :
#include <algorithm> #include <cstdio> using namespace std; const int N = 105; int n; int a[N]; int cnt; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a[i]); while (1) { int mx = n; for (int i = 1; i <= n; i++) if (a[i] >= a[mx]) mx = i; if (a[mx] == 0) break; int mn = a[mx]; for (int i = 1; i <= n; i++) if (a[i] > 0) mn = min(mn, a[i]); a[mx] -= mn; cnt++; } printf("%d\n", cnt); return 0; }
- 1
Information
- ID
- 66
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By