제출 #667744

#제출 시각아이디문제언어결과실행 시간메모리
667744Github학생 (COCI14_studentsko)C++14
100 / 100
2 ms412 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; #define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); #define ll long long int main() { speedup int n, k; cin >> n >> k; vector<pair<int, int>> array(n); for (int i = 0; i < n; i++){ cin >> array[i].first; array[i].second = i; } sort(array.begin(), array.end()); vector<int> a(n), l; for (int i = 0; i < n; i++){ a[array[i].second] = i/k; } for (int i = 0; i < n; i++){ auto pos = upper_bound(l.begin(), l.end(), a[i]); if (pos == l.end()){ l.push_back(a[i]); }else{ *pos = a[i]; } } cout << n-l.size() << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...