1578: Opening Ceremony
Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 175 Solved: 43Description
Input
Output
Sample Input
6 2 1 8 8 2 3
Sample Output
5
题意:可以删除一行或者一列,求最少步数
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long a[100005],dp[10000005];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
dp[0]=0;
for(int i=1;i<=n;i++)
{
dp[i]=min(dp[i-1]+1,a[i]);
}
printf("%d\n",dp[n]);
}
return 0;
}