# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402595 | wnsduds1 | 대표 선수 (KOI11_player) | C11 | 296 ms | 17044 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<stdlib.h>
typedef struct list {
int v;
int value;
}list;
void insert(list *x, list value);
list del(list *x);
list init(list arr[][1001],list que[], int n);
void q_sort(list *arr, int index_s, int index_e);
int bottom = 0;
int front[1001] = { 0, };
int abs_min = 987654321;
int main() {
int n, m, i, j, k;
list arr[1001][1001];
list que[1001];
list max, tmp, value;
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++)
{
for (k = 0; k < m; k++)
{
scanf("%d", &value.value);
value.v = i;
arr[i][k] = value;
}
q_sort(arr[i], 0, m - 1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |