Submission #4,030

2023-03-09 12:30:41

cpp17

Accepted 30/30

35ms

6640 KiB

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll n,k;
    cin>>n>>k;
    vector<ll>vec(k);
    deque<ll>q;
    for(ll i = 0; i < k; i++)
    {
        cin>>vec[i];
        q.push_front(vec[i]);
    } 
    sort(q.begin(), q.end());

    ll db = 0;
    for(ll i = 0; i < k; i++)
    {
        if(!q.empty() && q.front() < vec[i])
        {
            while (!q.empty() && q.front() != vec[i]) q.pop_front();
            db++;
        }
        if(!q.empty() && q.front() == vec[i]) q.pop_front();
    }
    cout<<db<<"\n";
}
/*
25 7
1 8 3 15 4 20 16
*/

	Sum	Test	Verdict		Time	Memory
base	30/30
		1	Accepted	0/0	3ms	1824 KiB
		2	Accepted	0/0	35ms	5076 KiB
		3	Accepted	1/1	2ms	2108 KiB
		4	Accepted	1/1	3ms	2236 KiB
		5	Accepted	1/1	2ms	2344 KiB
		6	Accepted	2/2	3ms	2692 KiB
		7	Accepted	2/2	3ms	2908 KiB
		8	Accepted	2/2	3ms	3120 KiB
		9	Accepted	1/1	17ms	4900 KiB
		10	Accepted	2/2	26ms	6204 KiB
		11	Accepted	3/3	25ms	6228 KiB
		12	Accepted	3/3	26ms	6528 KiB
		13	Accepted	1/1	35ms	6640 KiB
		14	Accepted	2/2	35ms	6516 KiB
		15	Accepted	3/3	32ms	6516 KiB
		16	Accepted	3/3	35ms	6640 KiB
		17	Accepted	3/3	35ms	6580 KiB