QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #445814 | #6540. Beautiful Sequence | _l_l_ | WA | 1ms | 4068kb | C++14 | 463b | 2024-06-16 14:57:21 | 2024-06-16 14:57:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
int main() {
int t; scanf("%d", &t); while (t--) {
int n; scanf("%d", &n); map<int, int> mp;
for (int i = 1; i <= n; i++) {int a; scanf("%d", &a); mp[a]++;}
vector<int> p; for (auto x : mp) p.push_back(x.second);
sort(p.begin(), p.end(), greater<int>()); int ans = n;
for (int x : p) {
if (n > x) ans--, n -= x + 1;
else n = -1;
}
printf("%d\n", ans);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3720kb
input:
2 6 1 1 2 3 3 4 5 1 2 2 3 3
output:
4 4
result:
ok 2 number(s): "4 4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 4068kb
input:
2 5 1 2 2 3 3 20 1 1 1 1 1 1 4 5 8 8 8 8 9 9 9 9 10 10 10 10
output:
4 17
result:
ok 2 number(s): "4 17"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3756kb
input:
300 14 1 1 1 2 2 2 3 3 3 4 5 5 6 6 14 1 1 1 2 2 3 3 4 4 5 5 6 7 7 14 1 1 2 2 3 4 4 4 5 5 5 6 6 6 14 1 1 2 2 3 3 3 4 5 5 5 6 6 6 14 1 1 1 1 1 1 2 2 2 2 2 3 3 3 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 14 1 2 2 3 4 5 5 6 6 6 7 8 8 8 14 1 2 2 2 2 2 3 4 5 6 7 8 9 10 14 1 2 2 3 4 4 4 5 6 6 6 6 6 7 14 1 1 2 2 2 3 3...
output:
11 10 11 11 12 14 10 9 11 11 9 10 10 9 11 12 11 10 10 12 10 9 10 10 11 11 11 11 11 11 10 9 10 10 10 11 11 13 11 12 11 11 9 10 10 11 11 10 11 9 11 10 11 10 11 10 10 10 11 11 12 10 10 10 10 10 9 11 11 11 11 10 10 10 11 10 11 10 10 10 9 10 9 11 9 12 10 11 12 12 9 9 11 9 12 11 10 12 10 11 11 10 10 9 11 ...
result:
wrong answer 1st numbers differ - expected: '10', found: '11'