Submission #4704144
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include<math.h> using namespace std; int main() { int N,x; cin >> N>>x; int S[110],count=0; for (int i = 0; i < N; i++)cin >> S[i]; sort(S, S + N); for (int i = 0; i < N; i++) { x -= S[i]; if (x < 0) break; count++; } if (x > 0)count -= 1; cout << count << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Candy Distribution Again |
User | yakyuubu7 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 363 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 | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |