# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
659020 | Cristian | Rabbit Carrot (LMIO19_triusis) | C++14 | 135 ms | 13176 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 <iostream>
#include <set>
#include <vector>
using namespace std;
const int NMAX = 200005;
int v[NMAX];
vector <int> a;
multiset <int> s;
int main()
{
int n, m, i;
cin >> n >> m;
for(i = 1; i <= n; i++)
{
cin >> v[i];
if(i*m - v[i] >= 0)
a.push_back(i*m - v[i]);
}
for(i = 0; i < a.size(); i++)
{
auto it = s.upper_bound(a[i]);
if(it != s.end())
s.erase(it);
s.insert(a[i]);
}
cout << n - s.size();
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... |