a901 STL

 

//求数组的最大元素和最小元素(以及它们的下标)

#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int a[10]={2,3,4,5,1,6,7,8,9,10};
    printf("%d %d\n",min_element(a,a+10)-a,*min_element(a,a+10));
    return 0;
}

　　

 

#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int a[120]={0},i,k,n,m,b;
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++){
    	scanf("%d",&b);
    	a[min_element(a,a+m)-a]+=b;
    }
    printf("%d\n",*max_element(a,a+m));
    return 0;
}