import java.io.*; import java.util.Arrays;public class Main {private static BufferedReader input;private static int ropeNumber;// 繩子數量private static int[] ropeLength;private static void initBufferedReader() {InputStream is = System.in;InputStreamReader isr = new InputStreamReader(is);input = new BufferedReader(isr);}private static void inputData() {String str = getLine();ropeNumber = Integer.parseInt(str);ropeLength = new int[ropeNumber];str = getLine();String[] arr = str.split(" ");for (int i = 0; i < ropeNumber; ++i) {ropeLength[i] = Integer.parseInt(arr[i]);}}private static String getLine() {String str = "";try {str = input.readLine();} catch (IOException e) {}return str;}private static void sortRope() {Arrays.sort(ropeLength);}private static int getMaxLength() {int length = ropeLength[0];for (int i = 1; i < ropeNumber; ++i) {length = (length + ropeLength[i]) / 2;}return length;}public static void main(String[] args) {initBufferedReader();inputData();sortRope();int maxLength = getMaxLength();System.out.println(maxLength);} } #include<iostream> #include<cstdio> #include<algorithm> //如果用vector的話就寫:#include<vector> using namespace std;int main() { int N,res; int exa[10001]; scanf("%d",&N);//這里可以用模板定義 vector <int> exa(N); for(int i=0;i<N;i++) { scanf("%d",&exa[i]); } sort(exa,exa+N);//如果用模板的話就寫sort(exa.begin(),exa.end()) ,進行排序。 res=exa[0]; for(int i=1;i<N;i++) { res=(res+exa[i])/2; } printf("%d\n",res); return 0; }

總結

以上是生活随笔為你收集整理的PAT_B_1070_Java(25分)_C++(25分)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。