The developers of Hackerworld want to
secure a database system consisting of n data
servers. The vulnerability of the jth server is
represented by server(I). An upgrade can be
done on any particular server to reduce
its vulnerability by 1 unit.
Given the vulnerabilities of the servers
represented by the array server, find the
maximum possible vulnerability of the
smallest element in the final vulnerabilities of
the servers after
performing exactly k upgrades.
The developers of Hackerworld want to secure a database system consisting of n data servers. The vulnerability of the jt
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am