Submission #1874335
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
int n,a[100005],ans;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
sort(a+1,a+n+1);
for (int i=1,j;i<=n;i=j){
for (j=i;a[j]==a[i];++j);
if (j-i>=a[i]) ans+=j-i-a[i]; else ans+=j-i;
}
printf("%d\n",ans);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Good Sequence |
| User | cyz666 |
| Language | C++14 (GCC 5.4.1) |
| Score | 300 |
| Code Size | 308 Byte |
| Status | AC |
| Exec Time | 18 ms |
| Memory | 640 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:5:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:6:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
^
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
| All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 0_00.txt | AC | 1 ms | 256 KiB |
| 0_01.txt | AC | 1 ms | 256 KiB |
| 0_02.txt | AC | 1 ms | 256 KiB |
| 0_03.txt | AC | 1 ms | 256 KiB |
| 0_04.txt | AC | 1 ms | 256 KiB |
| 1_00.txt | AC | 1 ms | 256 KiB |
| 1_01.txt | AC | 1 ms | 256 KiB |
| 1_02.txt | AC | 9 ms | 640 KiB |
| 1_03.txt | AC | 11 ms | 640 KiB |
| 1_04.txt | AC | 12 ms | 640 KiB |
| 1_05.txt | AC | 12 ms | 640 KiB |
| 1_06.txt | AC | 14 ms | 640 KiB |
| 1_07.txt | AC | 12 ms | 640 KiB |
| 1_08.txt | AC | 13 ms | 640 KiB |
| 1_09.txt | AC | 15 ms | 640 KiB |
| 1_10.txt | AC | 16 ms | 640 KiB |
| 1_11.txt | AC | 17 ms | 640 KiB |
| 1_12.txt | AC | 18 ms | 640 KiB |