#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MXN = 100 + 5;
const int p = 13131;//233333, 19260817
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
typedef unsigned long long ull;
int n, m, k;
struct node {
int x, y;
int val;
};
node cw[4005];
bool cmp(const node &a, const node &b) {
//const浣滅敤鏄繚璇佷笉浼氫慨鏀瑰厓绱燼鍜宐
//&浼犲紩鐢紝浣滅敤鏄姞閫?
return a.val > b.val;//val浠庡ぇ鍒板皬鎺掑簭
}
int main() {
scanf("%d%d%d", &n, &m, &k);
int cnt = 0;
for(int i = 1; i <= n; ++i) {
for(int j = 1, v; j <= m; ++j) {
scanf("%d", &v);
if(v > 0) {
cw[cnt].x = i, cw[cnt].y = j;
cw[cnt ++].val = v;
}
}
}
sort(cw, cw + cnt, cmp);//澶嶆潅搴? O(nlog(n))
int ans = 0;
for(int i = 0; i < cnt; +
1856: 花生采摘(NOIP 2004 PJT2)
最新推荐文章于 2024-04-06 22:16:54 发布