csp第一题Java版

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int []x=new int[n];
		for(int i=0;i<n;i++)
			x[i]=s.nextInt();
		int max,min;
		double mid = 0;
		if(n%2==1) {
			int m=n/2;
			mid=(int)x[m];
		}
		else if(n%2==0)
		{
			int i=n/2;
			int o=i-1;
			mid=((x[i]+x[o])/2.0);
		}
		max=(int)x[0];
		min=(int)x[n-1];
		if(max<min)
		{
			int temp=max;
			max=min;
			min=temp;
		}
		if(mid%1==0)
       System.out.print(max+" "+(int)mid+" "+min);
		else System.out.print(max+" "+mid+" "+min);
	}

}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int r=s.nextInt();
		int y=s.nextInt();
		int g=s.nextInt();
		int n=s.nextInt();
		int sum=0;
		int[][]x=new int[n][2];
		for(int i=0;i<n;i++)
			{x[i][0]=s.nextInt();
			 x[i][1]=s.nextInt();
			}
		for(int i=0;i<n;i++)
		{
			if(x[i][0]==0)
				sum=sum+x[i][1];
			else if(x[i][0]==1)
				sum=sum+x[i][1];
			else if(x[i][0]==2)
				sum=sum+x[i][1]+r;
		}
		System.out.print(sum);
	}

}