KY89 坠落的蚂蚁

很牛逼的思维题，记一下
ti
这个大佬的题解

#include<bits/stdc++.h>

using namespace std;

struct ant{
	int loc;
	int v;
};

bool cmp(ant a, ant b){
	return a.loc < b.loc;
}

int n;
ant a[100];

int main()
{
	while(cin>>n){
		ant op;
		for(int i = 0; i < n; i ++ ){
			cin>>a[i].loc>>a[i].v;
			if(a[i].v == 0) op = a[i];
		}
		sort(a, a + n, cmp);
		vector<int>l, r;
		for(int i = 0; i < n; i ++ ){
			if(a[i].loc < op.loc && a[i].v == 1) l.push_back(a[i].loc);
			else if(a[i].loc > op.loc && a[i].v == -1) r.push_back(a[i].loc);
		}
		
		if(l.size() == r.size()) cout<<"Cannot fall!"<<endl;
		else if(l.size() > r.size()) cout<<100 - l[l.size() - r.size() - 1]<<endl;
		else cout<<r[l.size()]<<endl;
	}
	return 0;
}