# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
248703 | Vladikus004 | Kronican (COCI16_kronican) | C++14 | 1 ms | 384 KiB |
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>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 22;
int n, k, a[N][N];
set <pair <int, int> > ms;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n >> k;
k = n - k;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cin >> a[i][j];
if (i != j)
ms.insert({a[i][j], i * n + j});
}
}
int ans = 0;
while (k--){
ans += ms.begin()->first;
int ind = ms.begin()->second;
ms.erase(ms.begin());
int x = ind / n, y = ind % n;
for (int i = 0; i < n; i++)
ms.erase({a[i][x], i * n + x});
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |