#include<bits/stdc++.h>
#include<ext/numeric>
#define fastIO ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
#define FOR(i, j, k, in) for (int i = (j); i < (k); i += (in))
#define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in))
#define RFORW(i, j, k, in) for (int i = (j); i > (k); i -= (in))
#define sz(arr) ((int)(arr).size())
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
using namespace __gnu_cxx;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef pair<int,pii> piii;
typedef vector<pii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
const int inf=INT_MAX-(13*7);
const float PI=acos(-1);
const ll linf=LLONG_MAX-(13ll*7ll);
priority_queue<piii> pq;
const int N = 22;
int n,k,ed,res;
bool check[N][N];
int main(){
#ifndef ONLINE_JUDGE
freopen("dungdich.inp","r",stdin);
freopen("dungdich.out","w",stdout);
#endif // ONLINE_JUDGE
fastIO;
cin>>n>>k;
FORW(i,1,n,1){
FORW(j,1,n,1){
int w;
cin>>w;
if(i!=j&&!check[i][j]) {pq.push(mp(w,mp(i,j))); ++ed;}
check[i][j]=check[j][i]=1;
}
}
while(ed>k&&!pq.empty()){
res+=pq.top().fi;
pq.pop();
--ed;
}
cout<<res;
}
//-T nghi la t khong the de mat 1 nguoi ban tot nhu m dau =)))
//
Compilation message
kronican.cpp: In function 'int main()':
kronican.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | freopen("dungdich.inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
kronican.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen("dungdich.out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 7 |
Incorrect |
3 ms |
380 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
