Submission #3426154
Source Code Expand
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; using Int = long long; int main() { int N, X; cin >> N >> X; vector<int> M(N); for (int i = 0; i < N; i++) cin >> M[i]; sort(M.begin(), M.end()); int sum = accumulate(M.begin(), M.end(), 0); cout << M.size() + (X-sum)/M[0] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Bitter Alchemy |
User | ha15 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 390 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |