蓝桥杯算法训练：数组排序与计算.pdfVIP

C++#includeiostream#include

algorithmusingnamespacestd;int

a[8],b[8];intmain(){intT,n;inti,j;

cinT;while(T‑‑){intsum=0;cin

n;for(i=0;in;i++)cina[i];for(i=0;i

n;i++)cinb[i];sort(a,a+n);sort(b,b+

n);for(i=0;in;i++){sum+a[i]*b[n‑1‑i];

}coutsumendl;}return0;}

C

#includestdio.hvoidsort1(int*a,int

n){inti,j;inttmp;for(i=0;in‑1;i++)

for(j=0;jn‑1‑i;j++)if(a[j]a[j+1]){tmp

a[j];a[j]a[j+1];a[j+1]tmp;}}void

sort2(int*a,intn){inti,j;inttmp;f

or(i=0;in‑1;i++)for(j=0;jn‑1‑i;j++)if(a[

j]a[j+1])

C++

#includeiostream

#includealgorithm

usingnamespacestd;

inta[8],b[8];

intmain()

{

intT,n;

inti,j;

cinT;

while(T--)

{

intsum=0;

cinn;

for(i=0;in;i++)

cina[i];

for(i=0;in;i++)

cinb[i];

sort(a,a+n);

sort(b,b+n);

for(i=0;in;i++)

{

sum+=a[i]*b[n-1-i];

}

coutsumendl;

}

return0;

}

C

#includestdio.h

voidsort1(int*a,intn)

{

inti,j;

inttmp;

for(i=0;in-1;i++)

for(j=0;jn-1-i;j++)

if(a[j]a[j+1])

{

tmp=a[j];

a[j]=a[j+1];

a[j+1]=tmp;

}