結果
| 問題 | 
                            No.191 供託金
                             | 
                    
| コンテスト | |
| ユーザー | 
                             threepipes_s
                         | 
                    
| 提出日時 | 2015-04-26 22:04:14 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                WA
                                 
                             
                            
                         | 
                    
| 実行時間 | - | 
| コード長 | 2,925 bytes | 
| コンパイル時間 | 2,227 ms | 
| コンパイル使用メモリ | 78,540 KB | 
| 実行使用メモリ | 50,604 KB | 
| 最終ジャッジ日時 | 2024-10-07 15:47:01 | 
| 合計ジャッジ時間 | 4,385 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge4 / judge3 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 3 | 
| other | AC * 22 WA * 1 | 
ソースコード
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.Comparator;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Queue;
public class Main {
	public static int[][] dist;
	public static int[][] distCp;
	public static int minId;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		int[] c = new int[n];
		int sum = 0;
		for(int i=0; i<n; i++){
			c[i] = in.nextInt();
			sum += c[i];
		}
		int res = 0;
		for(int i=0; i<n; i++){
			if(((double)c[i]*100)/sum <= 10) res++;
		}
		System.out.println(res*30);
	}
}
class Node implements Comparable<Node>{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
	
	@Override
	public int compareTo(Node o) {
		// TODO 自動生成されたメソッド・スタブ
		return Main.distCp[Main.minId][id]-Main.distCp[Main.minId][o.id];
	}
}
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 print(String str) {
		out.print(str);
	}
	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());
	}
}
            
            
            
        
            
threepipes_s