QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#232973 | #5507. Investors | sgrcn | WA | 1ms | 3520kb | C++17 | 795b | 2023-10-31 06:27:46 | 2023-10-31 06:27:46 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
int t, n, k;
cin >> t;
while(t--) {
cin >> n >> k;
vector<int> D(n), A;
int c = 0, ans = 0;
for(int i = 0 ; i < n ; ++i) cin >> D[i];
for(int i = 0 ; i < n-1 ; ++i) {
for(int j = i+1 ; j < n ; ++j) {
if(D[j] < D[i]) {
c++; ans++;
}
}
if(D[i+1]<D[i]) {
A.emplace_back(c);
c = 0;
}
}
sort(A.begin(), A.end(), std::greater<>());
for(int i = 0 ; i < A.size() && i < k ; ++i) ans -= A[i];
cout << ans << '\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3388kb
input:
2 6 1 4 5 6 2 2 1 6 2 4 5 6 2 2 1
output:
2 0
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3520kb
input:
349 6 2 2 1 2 1 2 1 48 12 42 47 39 39 27 25 22 44 45 13 5 48 38 4 37 6 24 10 42 38 12 37 31 19 44 6 29 17 7 12 7 26 35 24 15 9 37 3 27 21 33 29 34 20 14 30 31 21 48 12 1 43 17 46 17 39 40 22 25 2 22 12 4 11 38 12 4 11 1 5 39 44 37 10 19 20 42 45 2 45 37 20 48 34 16 41 23 18 13 44 47 21 29 4 23 18 16...
output:
1 139 79 373 0 8 2 0 86 101 179 0 0 0 1 0 0 0 0 0 0 0 0 361 3 0 0 2 0 0 0 0 0 0 1 0 3 0 0 1 0 0 2 0 0 1 15 0 0 0 0 0 0 0 0 2 0 2 0 0 58 513 0 0 207 4 0 1 0 0 3 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 3 0 0 0 0 0 0 0 31 1 37 0 0 0 0 1 94 5 0 0 0 39 0 0 0 0 0 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 10...
result:
wrong answer 2nd lines differ - expected: '18', found: '139'