Submission #3448227
Source Code Expand
#include <algorithm> #include <iostream> using namespace std; #define gsort(b, e) sort(b, e, greater<decltype(*b)>()) int main() { int N, K; cin >> N >> K; int a[N]; for (int i = 0; i < N; ++i) { cin >> a[i]; } gsort(a, a + N); int sum = 0; for (int i = 0; i < N; ++i) { sum += a[i]; if (sum >= K) { cout << i + 1 << endl; return 0; } } cout << -1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Credits |
User | Tiramister |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 504 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | corner_10, corner_11, corner_12, corner_13, max_14, random_00, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, sample_00, sample_01, sample_02 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner_10 | AC | 1 ms | 256 KB |
corner_11 | AC | 1 ms | 256 KB |
corner_12 | AC | 1 ms | 256 KB |
corner_13 | AC | 1 ms | 256 KB |
max_14 | AC | 1 ms | 256 KB |
random_00 | AC | 1 ms | 256 KB |
random_01 | AC | 1 ms | 256 KB |
random_02 | AC | 1 ms | 256 KB |
random_03 | AC | 1 ms | 256 KB |
random_04 | AC | 1 ms | 256 KB |
random_05 | AC | 1 ms | 256 KB |
random_06 | AC | 1 ms | 256 KB |
random_07 | AC | 1 ms | 256 KB |
random_08 | AC | 1 ms | 256 KB |
random_09 | AC | 1 ms | 256 KB |
sample_00 | AC | 1 ms | 256 KB |
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |