/*
来源:牛客
题目描述:度度熊想去商场买一顶帽子,商场里有N顶帽子,有些帽子的价格可能相同。度度熊想买一顶价格第三便宜的帽子,问第三便宜的帽子价格是多少?
作者:syt
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class BuyHat{
public:
int buyHat()
{
int ret = -1;
int N;
vector<int> res;
cin >> N;
for (int i = 0; i < N; i++){
int tmp;
cin >> tmp;
res.push_back(tmp);
}
sort(res.begin(), res.end());
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++){
if (res[i] > tmp && count < 3){
tmp = res[i];
count++;
}
}
if (count == 3)
ret = tmp;
else
ret = -1;
return ret;
}
};
来源:牛客
题目描述:度度熊想去商场买一顶帽子,商场里有N顶帽子,有些帽子的价格可能相同。度度熊想买一顶价格第三便宜的帽子,问第三便宜的帽子价格是多少?
作者:syt
日期:2017-6-28
思路:排序,取出第三便宜的即可,注意边界问题
*/#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class BuyHat{
public:
int buyHat()
{
int ret = -1;
int N;
vector<int> res;
cin >> N;
for (int i = 0; i < N; i++){
int tmp;
cin >> tmp;
res.push_back(tmp);
}
sort(res.begin(), res.end());
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++){
if (res[i] > tmp && count < 3){
tmp = res[i];
count++;
}
}
if (count == 3)
ret = tmp;
else
ret = -1;
return ret;
}
};