Submission #2525480
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main(){ int n; cin >>n; int a[n]; for(int i=0; i<n; i++) { cin >> a[i]; } sort(a,a+n); int k; int sum=1; int ans=0; if(n==1) { if(a[0]==1) cout << 0 <<endl; else cout <<1 <<endl; } else{ for(int i=0; i<n; i++) { if(a[i]==a[i+1]) sum++; else { if(sum==a[i]) sum=1; else if(sum>a[i]) { ans+=(sum-a[i]); sum=1; } else { ans+=sum; sum=1; } } } cout << ans <<endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Good Sequence |
User | nekoshka |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1031 Byte |
Status | AC |
Exec Time | 59 ms |
Memory | 640 KB |
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 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 20 ms | 640 KB |
1_03.txt | AC | 38 ms | 640 KB |
1_04.txt | AC | 42 ms | 640 KB |
1_05.txt | AC | 42 ms | 640 KB |
1_06.txt | AC | 59 ms | 640 KB |
1_07.txt | AC | 37 ms | 640 KB |
1_08.txt | AC | 42 ms | 640 KB |
1_09.txt | AC | 47 ms | 640 KB |
1_10.txt | AC | 50 ms | 640 KB |
1_11.txt | AC | 53 ms | 640 KB |
1_12.txt | AC | 58 ms | 640 KB |