#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <vector>
#include <stack>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pi;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define ABS(x) (((x) > 0 ) ? (x) : (-(x)))
#define MAX2(x, y) (((x) > (y)) ? (x) : (y))
#define MIN2(x, y) (((x) < (y)) ? (x) : (y))
#define MAX3(x, y, z) ( (x) > (y) ? ( (x) > (z) ? (x) : (z) ) : ( (y) > (z) ? (y) : (z) ) )
#define MIN3(x, y, z) ( (x) < (y) ? ( (x) < (z) ? (x) : (z) ) : ( (y) < (z) ? (y) : (z) ) )
#define MID3(val1,val2,val3) MAX2(MIN2(MAX2(val1,val2),val3),MIN2(val1,val2))
#define geti1(X) scanf("%d",&X)
#define geti2(X,Y) scanf("%d%d",&X,&Y)
#define geti3(X,Y,Z) scanf("%d%d%d",&X,&Y,&Z)
#define geti4(X,Y,Z,W) scanf("%d%d%d%d",&X,&Y,&Z,&W)
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define INF 987654321
#define IINF 7654321987654321
#define MOD 1000000
int N, M, K, T;
ll in[300005];
int main() {
geti2(N, K);
rep(i, N)
scanf("%lld", &in[i]);
sort(in, in+N, greater<int>());
ll sum = 0;
rep(i, (K+1) / 2)
sum += in[i];
rep(i, (K-1) / 2)
sum -= in[N-i-1];
printf("%lld", sum);
return 0;
}
Compilation message
wine.cpp: In function 'int main()':
wine.cpp:53:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
geti2(N, K);
^
wine.cpp:55:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &in[i]);
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 6 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 8 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 9 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 10 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 11 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 12 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 13 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 14 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 15 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 16 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 17 |
Correct |
3 ms |
4364 KB |
Output is correct |
| 18 |
Correct |
3 ms |
4364 KB |
Output is correct |
| 19 |
Correct |
6 ms |
4364 KB |
Output is correct |
| 20 |
Correct |
6 ms |
4364 KB |
Output is correct |
| 21 |
Correct |
16 ms |
4364 KB |
Output is correct |
| 22 |
Correct |
26 ms |
4364 KB |
Output is correct |
| 23 |
Correct |
29 ms |
4364 KB |
Output is correct |
| 24 |
Correct |
29 ms |
4364 KB |
Output is correct |
| 25 |
Correct |
96 ms |
4364 KB |
Output is correct |
| 26 |
Correct |
93 ms |
4364 KB |
Output is correct |
| 27 |
Correct |
86 ms |
4364 KB |
Output is correct |
| 28 |
Correct |
43 ms |
4364 KB |
Output is correct |
| 29 |
Correct |
93 ms |
4364 KB |
Output is correct |
| 30 |
Correct |
86 ms |
4364 KB |
Output is correct |
| 31 |
Correct |
93 ms |
4364 KB |
Output is correct |
| 32 |
Correct |
79 ms |
4364 KB |
Output is correct |
| 33 |
Correct |
0 ms |
4364 KB |
Output is correct |
| 34 |
Correct |
16 ms |
4364 KB |
Output is correct |
