Submission #3776922
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; int N, x; //人数N, お菓子の数x int main() { cin >> N >> x; vector<int> a(N); for (int i = 0; i < N; i++) { cin >> a[i]; } sort(a.begin(), a.end()); int satisfy = 0; for (int i = 0; i < N; i++) { int y = a[i]; if (y <= x) { //お菓子が足りるなら配る x -= y; satisfy++; } else { cout << satisfy << endl; return 0; } if (i == N - 1 && x > 0) { //最後まで配って余っていれば満足する人-1 satisfy--; } } cout << satisfy << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Candy Distribution Again |
User | knohkw |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 749 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 |