# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71029 | sebinkim | Lottery (CEOI18_lot) | C++14 | 645 ms | 12608 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 <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
int A[10101], T[10101], S[10101];
pii Q[111];
int ans[111][10101], print[111][10101];
int n, l, q;
int main()
{
int i, j;
scanf("%d%d", &n, &l);
for(i=1; i<=n; i++){
scanf("%d", A+i);
}
scanf("%d", &q);
for(i=1; i<=q; i++){
scanf("%d", &Q[i].first);
Q[i].second = i;
}
sort(Q + 1, Q + q + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |