Submission #28255

#TimeUsernameProblemLanguageResultExecution timeMemory
28255AcornCkiGuiziTeam (#68)Wine Tasting (FXCUP2_wine)C++14
1 / 1
89 ms3192 KiB
#include <stdio.h> #include <algorithm> #include <assert.h> #include <bitset> #include <cmath> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits.h> #include <map> #include <math.h> #include <queue> #include <set> #include <stdlib.h> #include <string.h> #include <string> #include <time.h> #include <unordered_map> #include <unordered_set> #include <vector> #pragma warning(disable:4996) #pragma comment(linker, "/STACK:1048576") using namespace std; #define mp make_pair #define all(x) (x).begin(), (x).end() #define ldb ldouble typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair <int, int> pii; typedef pair <ll, ll> pll; typedef pair <ll, int> pli; typedef pair <db, db> pdd; typedef tuple <int, int, int> t3; int IT_MAX = 1 << 17; const ll MOD = 1000000007; const int INF = 0x3f3f3f3f; const ll LL_INF = 0x3f3f3f3f3f3f3f3f; const db PI = acos(-1); const db ERR = 1e-10; #define szz(x) (int)(x).size() #define rep(i, n) for(int i=0;i<(n);i++) int in[300050]; int main() { int N, K, i; scanf("%d %d", &N, &K); for (i = 1; i <= N; i++) scanf("%d", &in[i]); sort(in + 1, in + N + 1); ll s = 0; for (i = N; i > N - (K + 1) / 2; i--) s += in[i]; for (i = 1; i < (K + 1) / 2; i++) s -= in[i]; return !printf("%lld\n", s); }

Compilation message (stderr)

wine.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 ^
wine.cpp:24:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:1048576")  
 ^
wine.cpp: In function 'int main()':
wine.cpp:53:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &K);
                        ^
wine.cpp:54:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 1; i <= N; i++) scanf("%d", &in[i]);
                                              ^
#Verdict Execution timeMemoryGrader output
Fetching results...