PAT(A) -- 2018春季考试-甲级 1144 The Missing Number (20分）

最新推荐文章于 2022-03-18 02:14:44 发布

隔壁de小刘

最新推荐文章于 2022-03-18 02:14:44 发布

阅读量157

点赞数

分类专栏： PAT算法笔记

本文链接：https://blog.csdn.net/qq_21480607/article/details/107077644

版权

PAT算法笔记专栏收录该内容

61 篇文章 3 订阅

订阅专栏

1144 The Missing Number (20分)
Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤10
5
). Then N integers are given in the next line, separated by spaces. All the numbers are in the range of int.

Output Specification:
Print in a line the smallest positive integer that is missing from the input list.

Sample Input:

10
5 -25 9 6 1 3 4 2 5 17

Sample Output:

#include "iostream"
#include "map"
using namespace std;
map<int,int> e;
int main(){
	int n,k;
	cin>>n;
	for (int i=0;i<n;i++)
	{
		scanf("%d",&k);
		e[k]++;
	}
	int num=1;
	while (e[num]>0)num++;
	cout<<num<<endl;
	return 0;
}