Cuối cùng tôi cũng có rating(tuy hơi ít)...
Cán mốc 39000 điểm, 16h09m20s, 16/8/2024 !!!
Mục tiêu top 1 ranking
Count:
Join my group and you'll get 1000000000$
https://lqdoj.edu.vn/organization/1556-FanMU
My codeforces: https://codeforces.com/profile/amongussssiuuu

tôi chỉ là một thằng gà tập làm coder

def find_minimum_sum(arr):
# Sort the array first
n = len(arr)
arr.sort()

# Find median
if n % 2 == 0:
    # If even length, any value between two middle elements works
    # We'll use the left middle element
    s = arr[n//2 - 1]
else:
    # If odd length, use middle element
    s = arr[n//2]

# Calculate minimum sum of absolute differences
min_sum = 0
for x in arr:
    min_sum += abs(x - s)

return s, min_sum

Example usage

arr = [1, 8, 3, 4, 9, 2]
s, result = find_minimum_sum(arr)
print(f"Optimal value s = {s}")
print(f"Minimum sum = {result}")

include <bits/stdc++.h>

using namespace std;

int main()
{
int n;
cin>>n;
while(n--)
{
string s;
cin>>s;
sort(s.begin(),s.end(),greater<char>());
cout<<s<<endl;
}
}

include <bits/stdc++.h>

using namespace std;
int n,m,i,cl;
int a[100];
int main()
{
cin>>n>>m;
int d=0;
int chia=n/m;
if (chia <1)
{
a[1]=chia;
d++;
cl=1-chia;
for (i=2;i<m;i++)
{
a[i]=cl+(chia-cl);
d++;
}
a[m]=cl;
}
cout<<d;
return 0;
}