Contest Duration: - (local time) (100 minutes) Back to Home

Submission #3076767

Source Code Expand

Copy
```#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<28)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

int n, k, ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
vector<int> x(n);
vector<pair<int, bool> > cnt;
rep(i, 0, n) {
cin >> x[i];
cnt.pb(mp(abs(x[i]), x[i] > 0 ? true : false));
}
sort(all(cnt));
bool sign = cnt[0].second == 1 ? true : false, flag = true;
rep(i, 0, k) if (cnt[i].second != sign) flag = false;
if (flag) ans = cnt[k-1].first;
else if ((find(all(x), cnt[k-2].first) != x.end() || find(all(x), -cnt[k-2].first) != x.end()))
ans = min(2 * cnt[k-2].first + cnt[k-1].first, 2 * cnt[k-1].first + cnt[k-2].first);
cout << ans << endl;
return 0;
}
```

#### Submission Info

Submission Time 2018-08-25 21:55:47+0900 C - Candles kage C++14 (GCC 5.4.1) 0 1386 Byte WA 20 ms 1784 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
 AC × 4
 AC × 8 WA × 4
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt WA 19 ms 1784 KB
1_01.txt WA 20 ms 1784 KB
1_02.txt AC 14 ms 1784 KB
1_03.txt AC 14 ms 1784 KB
1_04.txt AC 13 ms 1784 KB
1_05.txt AC 13 ms 1784 KB
1_06.txt WA 14 ms 1784 KB
1_07.txt WA 14 ms 1784 KB