hdoj1040簡單題

#include<iostream>using namespace std;int main(){int m, n;cin>>m;for(int k = 0; k < m; k++){//處理每一行cin>>n;int a[1005];for(int i = 0; i < n; i++){//處理每行的每個值cin>>a[i];}for(int i = 0; i < n - 1; i++){//冒泡排序for(int j = 0; j < n - i - 1; j++){if(a[j] > a[j + 1]){int temp;temp = a[j];a[j] = a[j + 1];a[j + 1] = temp;}}}for(int i = 0; i < n - 1; i++){//輸出cout<<a[i]<<" ";}cout<<a[n - 1]<<endl;}}