結果
問題 | No.750 Frac #1 |
ユーザー |
![]() |
提出日時 | 2018-11-09 21:58:15 |
言語 | Java17 (openjdk 17.0.1) |
結果 |
AC
|
実行時間 | 72 ms / 1,000 ms |
コード長 | 2,732 bytes |
コンパイル時間 | 1,884 ms |
使用メモリ | 35,704 KB |
最終ジャッジ日時 | 2022-12-26 19:59:19 |
合計ジャッジ時間 | 5,761 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
35,300 KB |
testcase_01 | AC | 70 ms
35,700 KB |
testcase_02 | AC | 70 ms
35,452 KB |
testcase_03 | AC | 69 ms
35,468 KB |
testcase_04 | AC | 70 ms
35,524 KB |
testcase_05 | AC | 71 ms
35,456 KB |
testcase_06 | AC | 70 ms
35,544 KB |
testcase_07 | AC | 69 ms
35,704 KB |
testcase_08 | AC | 69 ms
35,548 KB |
testcase_09 | AC | 69 ms
35,484 KB |
testcase_10 | AC | 69 ms
35,580 KB |
testcase_11 | AC | 71 ms
35,496 KB |
testcase_12 | AC | 70 ms
35,652 KB |
testcase_13 | AC | 70 ms
35,384 KB |
testcase_14 | AC | 69 ms
35,484 KB |
testcase_15 | AC | 70 ms
35,364 KB |
testcase_16 | AC | 70 ms
35,580 KB |
testcase_17 | AC | 70 ms
35,580 KB |
testcase_18 | AC | 72 ms
35,408 KB |
testcase_19 | AC | 69 ms
35,560 KB |
testcase_20 | AC | 70 ms
35,376 KB |
testcase_21 | AC | 70 ms
35,428 KB |
testcase_22 | AC | 69 ms
35,444 KB |
testcase_23 | AC | 69 ms
35,312 KB |
testcase_24 | AC | 71 ms
35,560 KB |
testcase_25 | AC | 72 ms
35,360 KB |
testcase_26 | AC | 70 ms
35,392 KB |
testcase_27 | AC | 71 ms
35,392 KB |
testcase_28 | AC | 72 ms
35,356 KB |
testcase_29 | AC | 71 ms
35,576 KB |
testcase_30 | AC | 69 ms
35,548 KB |
testcase_31 | AC | 70 ms
35,588 KB |
testcase_32 | AC | 70 ms
35,456 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Map; import java.util.NoSuchElementException; import java.util.TreeMap; public class Main { public static void main(String args[]) { FastScanner scanner = new FastScanner(); int n=scanner.nextInt(); int[] a=new int[n]; int[] b=new int[n]; Map<Double,Integer>map=new TreeMap<>(); for(int i=0;i<n;i++) { a[i]=scanner.nextInt(); b[i]=scanner.nextInt(); map.put((double)a[i]/b[i], i); } int t[]=new int[n]; int i=n-1; for(int k:map.values()) { t[i]=k; i--; } for(int k=0;k<n;k++) { System.out.println(a[t[k]]+" "+b[t[k]]); } } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }