1题目的大致意思就是
输入N和M表示N个加号和M个减号
然后输入N+M+1个数字(运算符加进去所需要的数字个数)
凑成结果最大值
我的思路很对,无奈快速排序忘了,调试了一个多钟头无济于事唉心累
思路:
快速排序,让最大的N+1个数字的和减去最小M个数字的和
代码如下
#include<stdio.h>
#include<stdlib.h>
void swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
}
void quickSort(int *&arr, int below, int high)
{
int i = below, j = high;
int key = arr[below];
if (below >= high)
{
return;
}
while (below < high)
{
while (below < high&&key <= arr[high])
--high;
if (key > arr[high])
{
swap(&arr[below], &arr[high]);
++below;
}
while (below < high&&key >= arr[below])
++below;
if (key < arr[below])
{
swap(&arr[below], &arr[high]);
--high;//比较完后运动high的下标
}
}
quickSort(arr, i, below - 1);
quickSort(arr, below + 1, j);
}
int main()
{
int n, m,sum1=0,sum2=0;
scanf("%d%d", &n, &m);//n代表多少个加号,m代表多少个减号
int size = n + m + 1;
int *arr = (int *)malloc(sizeof(int)*size);
for (int i = 0; i < size; i++)
{
scanf("%d", &arr[i]);//获取数据
}
//将数据排序
quickSort(arr, 0, size - 1);
for (int i = 0; i < size; i++)
{
printf("%d ", arr[i]);
}
for (int i = 0; i < m; i++)
{
sum1 += arr[i];
}
for (int i = m; i < size; i++)
{
sum2 += arr[i];
}
printf("%d\n%d", sum1,sum2);
system("pause");
return 0;
}