# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503307 | rainboy | Akcija (COCI21_akcija) | C11 | 1 ms | 296 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>
#define N 2000
int main() {
static int ww[N], dd[N];
static int kk[N];
int n, c, i, d, k, k_;
scanf("%d%d", &n, &c);
for (i = 0; i < n; i++) {
scanf("%d%d", &ww[i], &dd[i]), dd[i]--;
kk[dd[i]]++;
}
k_ = 0;
for (d = n - 1, k = 0; d >= 0; d--) {
k += kk[d];
if (k > 0)
k--, k_++;
}
printf("%d %d\n", k_, ww[0] * n);
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |