Submission #39422

# Submission time Handle Problem Language Result Execution time Memory
39422 2018-01-15T02:57:28 Z adamczh1 Baloni (COCI15_baloni) C++14
100 / 100
396 ms 2152 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define SIZE(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define ff first
#define ss second

inline ll readi(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int main(){
	int N=readi();
	multiset<int> s;
	int ans=0;
	for(int i=0;i<N;i++){
		int H=readi();
		if(s.find(H)==s.end()){
			ans++;
		}
		else{
			s.erase(s.find(H));
		}
		s.insert(H-1);
	}
	cout<<ans<<endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2152 KB Output is correct
3 Correct 0 ms 2152 KB Output is correct
4 Correct 0 ms 2152 KB Output is correct
5 Correct 323 ms 2152 KB Output is correct
6 Correct 396 ms 2152 KB Output is correct
7 Correct 303 ms 2152 KB Output is correct
8 Correct 316 ms 2152 KB Output is correct
9 Correct 296 ms 2152 KB Output is correct
10 Correct 376 ms 2152 KB Output is correct