This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define bananas return 0;
#define ll long long
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
const int N=2e5+6;
const int INF=1e9+6;
int main() {
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
IOS
int n,m;
cin>>n>>m;
int a[n+1];
for (int i=1;i<=n;i++) {
cin>>a[i];
}
sort(a+1,a+1+n);
ll sum=0;
if (m==1) {
cout<<a[n];
return 0;
}
if (n-1==m) {
for (int i=1;i<=n;i++) {
sum+=a[i];
}
cout<<sum;
return 0;
}
if (m%2==1) {
for (int i=1;i<=m/2+1;i++) {
sum+=a[i];
}
int cnt=0;
for (int i=n;i>=1;i--) {
sum+=a[i];
cnt++;
if (cnt==m/2) break;
}
}else {
for (int i=1;i<=m/2;i++) {
sum+=a[i];
}
int cnt=0;
for (int i=n;i>=1;i--) {
sum+=a[i];
cnt++;
if (cnt==m/2) break;
}
}
cout<<sum;
bananas
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |