# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171496 | nuutsnoynton | Studentsko (COCI14_studentsko) | C++20 | 19 ms | 840 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e5 + 2;
ll lo[N], hi[N];
int main() {
ll n, m, r, x, y, lo1, hi1, cnt, s, i, j, ans, t;
cin >> n >> m;
ll a[n + 2];
pair < ll, ll > b[n + 2];
vector < ll > v;
vector < ll > ind;
for (i = 1; i <= n; i ++) {
cin >> a[i];
ind.push_back(i);
v.push_back(a[i]);
b[i] = {a[i], i};
}
sort ( b + 1, b + n + 1);
// reverse(b + 1, b + n + 1);
for (i = 1; i <= n; i ++) {
s = (i - 1) / m;
s = s * 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |