/************************************************
*
* 函数:main.cpp
* 功能:求解某种食物的排序
* 时间:2018-09-18
*
************************************************/
#include<iostream>
#include<vector>
#include <algorithm> //排序头文件
using namespace std;
//降序排列的方法
bool cmp2(pair<int, int>a, pair<int, int>b)
{
return a.second > b.second;
}
int main(void)
{
int N,M,P;
vector<pair<int,int>> array;
cout<<"Please input M,N,P(种类、天数、求哪一种): ";
cin >> N >> M >> P;
cout<<"Please input 菜数Ai("<<N<<")"<<": ";
for(int i = 1; i <= N; i++)
{
int temp;
cin >> temp;
array.push_back(make_pair(i,temp));
}
//cout<<"原先菜数"<<endl;
//for(int i=0;i!=array.size();i++)
//{
// cout << array[i].first <<" "<<array[i].second<< endl;
//}
cout<<"怎么吃的"<<endl;
for(int i = 0; i < M; i++)
{
char ch; //动作
int index; //种类
cin >> ch >>index;
if('A' == ch)
array[index-1].second += 1;
if('B' == ch)
array[index-1].second -= 1;
}
//cout<<"吃后菜数"<<endl;
//for(int i=0;i!=array.size();i++)
//{
// cout << array[i].first <<" "<<array[i].second<< endl;
//}
sort(array.begin(),array.end(),cmp2);
//cout<<"排序后菜数"<<endl;
//for(int i=0;i!=array.size();i++)
//{
// cout << array[i].first <<" "<<array[i].second<< endl;
//}
cout<<"结果"<<endl;
for(int i=0;i!=array.size();i++)
{
if(array[i].first==P)
cout<<i+1<<endl;
}
// cout<<N<<" "<<M<<" "<<P;
system("pause");
return 0;
}