AcWing 3541. 找最小数
原题链接
简单
作者:
Ruily
,
2024-05-19 19:48:01
,
所有人可见
,
阅读 1
#include <iostream>
#include <map>
using namespace std;
int main()
{
multimap<int,int> mp;
int n;
cin >> n;
while ( n -- )
{
int a,b;
cin >> a >> b;
mp.emplace(a,b);
}
int x,y = 1010;
bool flag = false;
for(auto i = next(mp.begin()); i != mp.end(); ++i)
{
// cout << prev(i) -> first << " " << i -> first << endl;
if(prev(i) -> first == i -> first)
{
flag = true;
if((prev(i) -> second) < y) x = prev(i) -> first , y = prev(i) -> second;
// else x = i -> first, y = i -> second;
}
else
{
if(flag)
{
if((prev(i) -> second) < y) x = prev(i) -> first , y = prev(i) -> second;
break;
}
x = prev(i) -> first, y = prev(i) -> second;
break;
}
}
cout << x << " " << y;
return 0;
}