题目描述:
每个方块为1 * 1,一行满得1分
输入:
第一行:总行数,方块个数
第二行:每个方块的位置
例子:输入
3 9
1 1 2 2 2 3 1 2 3
输出
2
解题思路:对列数进行排序,统计每一列的个数,取最小值(保证每一列都有方块),如果有一列缺少方块,则结果为0
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int>lines(m);
for (int i = 0; i < m; i++){
cin >> lines[i];
}
int j = 1;
int count = 0;
int result = 1e5;
sort(lines.begin(), lines.end());
for (int i = 0; i < m; i++){
if (lines[i] == j){
count++;
}
else if (lines[i] == j + 1){
result = min(result, count);
j++;
count=1;
}
else{
result = 0;
break;
}
}
if (j != n){
result = 0;
}
result = min(result, count);
cout << result << endl;
system("pause");
return 0;
}
另一种解法:定义一个大小为n的vector,代表第i+1列拥有方块的个数,对其进行排序,输出列中个数最小的值,即为所求结果,具体实现如下:
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int>lines(m);
for (int i = 0; i < m; i++){
cin >> lines[i];
}
vector<int>line_total(n,0);
for (int i = 0; i < m; i++){
line_total[lines[i]-1]++;
}
sort(line_total.begin(), line_total.end());
cout << line_total[0] << endl;
system("pause");
return 0;
}