为什么UKE!
查看原帖
为什么UKE!
1122193
FarmerDrone楼主2024/1/22 12:11
#include <bits/stdc++.h>
using namespace std;
int main()
{
	long long n, k, s1, s2, s;
	s1 = s2 = s = 0;
	cin >> n >> k;
	long long N[n + 20];
	if (2 * k > n)
	{
		for (long long i = 0; i < n; i++)
		{
			cin >> N[i];
			s += N[i];
		}
		for (long long i = 0; i < n - k; i++)
		{
			for (long long j = i + 1; j < n; j++)
			{
				if (N[i] < N[j])
					swap(N[i], N[j]);
			}
			s2 += N[i];
		}
		cout << s - s2 << endl;
	}
	else
	{
		for (long long i = 0; i < n; i++)
			cin >> N[i];
		for (long long i = 0; i < k; i++)
		{
			for (long long j = i + 1; j < n; j++)
			{
				if (N[i] > N[j])
					swap(N[i], N[j]);
			}
			s1 += N[i];
		}
		cout << s1 << endl;
	}
	return 0;
} 

2024/1/22 12:11
加载中...