結果

問題 No.231 めぐるはめぐる (1)
ユーザー threepipes_sthreepipes_s
提出日時 2015-06-26 22:35:29
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,265 bytes
コンパイル時間 2,534 ms
コンパイル使用メモリ 88,336 KB
実行使用メモリ 53,492 KB
最終ジャッジ日時 2024-07-07 17:45:52
合計ジャッジ時間 5,910 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 99 ms
51,220 KB
testcase_02 AC 97 ms
51,296 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 107 ms
51,836 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 104 ms
51,572 KB
testcase_10 AC 103 ms
51,000 KB
testcase_11 AC 87 ms
51,164 KB
testcase_12 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.TreeMap;

public class Main {
	public static int[] dp;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
//		int[] g = new int[n];
//		int[] d = new int[n];
		A[] a = new A[n];
		for(int i=0; i<n; i++){
			int g = in.nextInt();
			int d = in.nextInt();
			a[i] = new A(i+1, g - 30000*d);
		}
		Arrays.sort(a);
		int res = 30000*100 - a[n-1].a*6;
		String r = "";
		for(int i=0; i<6; i++){
			r += "\n"+a[n-1].id;
		}
		System.out.println(res > 0 ? "NO" : ("YES"+r));
	}
}

class A implements Comparable<A>{
	int id;
	int a;
	A(int id, int a){
		this.id = id;
		this.a = a;
	}
	@Override
	public int compareTo(A o) {
		return o.a - a;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0