# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001 | tncks0121 | 대표 선수 (KOI11_player) | C++98 | 268 ms | 8904 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<stdio.h>
#include<algorithm>
using namespace std;
#define N_ 1000
int N, M;
struct S1{
int x, dat;
bool operator< (const S1 &t) const { return dat < t.dat; }
}D[N_*N_+1];
int Chk [N_+1], cnt;
int res = 2147483647;
int main(){
int i, j;
scanf("%d%d",&N,&M);
for(i=1; i<=N; i++){
for(j=1; j<=M; j++){
int v = (i-1) * M + j;
scanf("%d",&D[v].dat);
D[v].x = i;
}
}
sort(D+1, D+N*M+1);
Chk[D[1].x] ++; cnt ++;
for(i=j=1; i<=N*M && j<=N*M; ){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |