結果
問題 | No.156 キャンディー・ボックス |
ユーザー | amyu |
提出日時 | 2016-02-22 09:27:12 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 3,735 bytes |
コンパイル時間 | 2,260 ms |
コンパイル使用メモリ | 75,984 KB |
実行使用メモリ | 49,688 KB |
最終ジャッジ日時 | 2023-09-19 03:05:42 |
合計ジャッジ時間 | 5,180 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,164 KB |
testcase_01 | AC | 45 ms
49,352 KB |
testcase_02 | AC | 45 ms
49,316 KB |
testcase_03 | AC | 44 ms
49,120 KB |
testcase_04 | AC | 45 ms
49,172 KB |
testcase_05 | AC | 45 ms
48,908 KB |
testcase_06 | AC | 44 ms
49,108 KB |
testcase_07 | AC | 45 ms
49,196 KB |
testcase_08 | AC | 44 ms
49,392 KB |
testcase_09 | AC | 45 ms
49,628 KB |
testcase_10 | AC | 45 ms
49,688 KB |
testcase_11 | AC | 44 ms
49,252 KB |
testcase_12 | AC | 45 ms
49,236 KB |
testcase_13 | AC | 45 ms
49,244 KB |
testcase_14 | AC | 44 ms
49,228 KB |
testcase_15 | AC | 45 ms
49,352 KB |
testcase_16 | AC | 44 ms
48,904 KB |
testcase_17 | AC | 45 ms
49,400 KB |
testcase_18 | AC | 44 ms
49,252 KB |
testcase_19 | AC | 45 ms
49,228 KB |
testcase_20 | AC | 45 ms
48,904 KB |
testcase_21 | AC | 45 ms
49,208 KB |
testcase_22 | AC | 45 ms
49,336 KB |
testcase_23 | AC | 45 ms
49,124 KB |
testcase_24 | AC | 45 ms
49,384 KB |
testcase_25 | AC | 44 ms
49,308 KB |
testcase_26 | AC | 44 ms
49,160 KB |
testcase_27 | AC | 44 ms
49,116 KB |
testcase_28 | AC | 45 ms
49,132 KB |
testcase_29 | AC | 45 ms
49,512 KB |
testcase_30 | AC | 45 ms
49,220 KB |
testcase_31 | AC | 44 ms
49,228 KB |
testcase_32 | AC | 45 ms
49,228 KB |
testcase_33 | AC | 45 ms
49,224 KB |
ソースコード
import java.util.*; import java.io.*; public class Main{ static final Reader sc = new Reader(); static final PrintWriter out = new PrintWriter(System.out,false); public static void main(String[] args) throws Exception { int n = sc.nextInt(); int m = sc.nextInt(); int[] c = new int[n]; for(int i=0;i<n;i++){ c[i] = sc.nextInt(); } Arrays.sort(c); int now = 0; while(now<n){ if(c[now]>m){ break; } else{ m -= c[now]; } now++; } out.println(now); out.flush(); sc.close(); out.close(); } static void trace(Object... o) { System.out.println(Arrays.deepToString(o));} } class Reader { private final InputStream in; private final byte[] buf = new byte[1024]; private int ptr = 0; private int buflen = 0; public Reader() { this(System.in);} public Reader(InputStream source) { this.in = source;} private boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} public boolean hasNext() {skip(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } public int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } public double nextDouble() { return Double.parseDouble(next()); } public char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } public String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i=0; i<n; i++) res[i] = nextInt(); return res; } public char[] nextCharArray(int n) { char[] res = new char[n]; for (int i=0; i<n; i++) res[i] = nextChar(); return res; } public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}}; }