飞步无人驾驶2018届校园招聘在线笔试A轮 register

Ended

Participants:152

Verdict:Time Limit Exceeded
Score:90 / 100
Submitted:2018-10-06 20:05:25

Lang:Java

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        ArrayList<Good> goods = new ArrayList<>();
        for (int i = 0i < n++i) {
            goods.add(new Good(scanner.nextInt(), scanner.nextLine().trim()));
        }
        int min = 400000;
        for (int i = 0i < n++i) {
            Good g1 = goods.get(i);
            String str = g1.attr;
            if (str.contains("A"&& str.contains("B"&& str.contains("C")) {
                if (min > g1.cost) {
                    min = g1.cost;
                }
            } else {
                for (int j = i + 1j < n++j) {
                    Good g2 = goods.get(j);
                    str = g1.attr + g2.attr;
                    if (str.contains("A"&& str.contains("B"&& str.contains("C")) {
                        min = Math.min(ming1.cost + g2.cost);
                    } else {
                        for (int k = j + 1k < n++k) {
                            Good g3 = goods.get(k);
                            str = g1.attr + g2.attr + g3.attr;
                            if (str.contains("A"&& str.contains("B"&& str.contains("C")) {
                                min = Math.min(ming1.cost + g2.cost + g3.cost);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX