Submission #5496982

Source Code Expand

Copy
```import java.io.*;
import java.util.*;

public class Main {
private static int solve(int x, int[] as) {
int count = 0;
Arrays.sort(as);
for (int a : as) {
if (x >= a) {
x -= a;
count++;
} else {
x = 0;
break;
}
}
if (x > 0) {
return count - 1;
} else {
return count;
}
}

out.println(solve(x, as));
}

public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
out.flush();
}
}

private StringTokenizer tokenizer;

}

public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
} catch (Exception e) {
throw new RuntimeException(e);
}
}
}

public int nextInt() {
return Integer.parseInt(next());
}

public long nextLong() {
return Long.parseLong(next());
}

public double nextDouble() {
return Double.parseDouble(next());
}

public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) {
array[i] = nextInt();
}
return array;
}

public long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) {
array[i] = nextLong();
}
return array;
}
}

class Algorithm {
private static void swap(Object[] list, int a, int b) {
Object tmp = list[a];
list[a] = list[b];
list[b] = tmp;
}

public static <T extends Comparable<? super T>> boolean nextPermutation(T[] ts) {
int rightMostAscendingOrderIndex = ts.length - 2;
while (rightMostAscendingOrderIndex >= 0 &&
ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostAscendingOrderIndex + 1]) >= 0) {
rightMostAscendingOrderIndex--;
}
if (rightMostAscendingOrderIndex < 0) {
return false;
}

int rightMostGreatorIndex = ts.length - 1;
while (ts[rightMostAscendingOrderIndex].compareTo(ts[rightMostGreatorIndex]) >= 0) {
rightMostGreatorIndex--;
}

swap(ts, rightMostAscendingOrderIndex, rightMostGreatorIndex);
for (int i = 0; i < (ts.length - rightMostAscendingOrderIndex - 1) / 2; i++) {
swap(ts, rightMostAscendingOrderIndex + 1 + i, ts.length - 1 - i);
}
return true;
}
}

```

#### Submission Info

Submission Time 2019-05-21 07:40:13+0900 A - Candy Distribution Again toshihoge Java8 (OpenJDK 1.8.0) 200 2905 Byte AC 81 ms 21332 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 200 / 200 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 71 ms 19284 KB
0_01.txt 68 ms 19540 KB
0_02.txt 71 ms 19924 KB
0_03.txt 70 ms 18132 KB
1_00.txt 70 ms 21332 KB
1_01.txt 70 ms 18772 KB
1_02.txt 73 ms 18260 KB
1_03.txt 69 ms 19284 KB
1_04.txt 72 ms 21332 KB
1_05.txt 71 ms 19412 KB
1_06.txt 81 ms 18132 KB
1_07.txt 73 ms 18516 KB