結果
問題 | No.750 Frac #1 |
ユーザー |
![]() |
提出日時 | 2018-11-09 21:30:25 |
言語 | Java17 (openjdk 17.0.1) |
結果 |
AC
|
実行時間 | 96 ms / 1,000 ms |
コード長 | 3,309 bytes |
コンパイル時間 | 2,081 ms |
使用メモリ | 37,820 KB |
最終ジャッジ日時 | 2022-12-26 19:36:45 |
合計ジャッジ時間 | 6,569 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
37,736 KB |
testcase_01 | AC | 93 ms
37,716 KB |
testcase_02 | AC | 94 ms
37,820 KB |
testcase_03 | AC | 92 ms
37,620 KB |
testcase_04 | AC | 96 ms
37,480 KB |
testcase_05 | AC | 93 ms
37,496 KB |
testcase_06 | AC | 96 ms
37,672 KB |
testcase_07 | AC | 95 ms
37,516 KB |
testcase_08 | AC | 94 ms
37,760 KB |
testcase_09 | AC | 95 ms
37,604 KB |
testcase_10 | AC | 92 ms
37,728 KB |
testcase_11 | AC | 94 ms
37,604 KB |
testcase_12 | AC | 92 ms
37,756 KB |
testcase_13 | AC | 94 ms
37,636 KB |
testcase_14 | AC | 93 ms
37,480 KB |
testcase_15 | AC | 92 ms
37,600 KB |
testcase_16 | AC | 93 ms
37,608 KB |
testcase_17 | AC | 95 ms
37,648 KB |
testcase_18 | AC | 96 ms
37,744 KB |
testcase_19 | AC | 95 ms
37,612 KB |
testcase_20 | AC | 93 ms
37,704 KB |
testcase_21 | AC | 96 ms
37,584 KB |
testcase_22 | AC | 92 ms
37,732 KB |
testcase_23 | AC | 95 ms
37,692 KB |
testcase_24 | AC | 96 ms
37,484 KB |
testcase_25 | AC | 95 ms
37,456 KB |
testcase_26 | AC | 93 ms
37,520 KB |
testcase_27 | AC | 92 ms
37,536 KB |
testcase_28 | AC | 94 ms
37,532 KB |
testcase_29 | AC | 93 ms
37,464 KB |
testcase_30 | AC | 94 ms
37,556 KB |
testcase_31 | AC | 95 ms
37,596 KB |
testcase_32 | AC | 95 ms
37,576 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); T[] t = new T[n]; for (int i = 0; i < n; i++) { double a = in.nextDouble(), b = in.nextDouble(); t[i] = new T(a, b, a/b); } Arrays.sort(t); for (int i = 0; i < n; i++) { out.printf("%d %d\n", (int)t[i].a, (int)t[i].b); } } } static class T implements Comparable<T> { double a, b, c; public T(double a, double b, double c) { super(); this.a = a; this.b = b; this.c = c; } @Override public int compareTo(T o) { return -Double.compare(this.c, o.c); } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }