Submission #1175275

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
typedef long long ll;
struct A{
	int a,b;
};
bool operator<(A a,A b){return a.a<b.a;}
int main() {
	A a[3];
	a[0].b=1;
	a[1].b=2;
	a[2].b=3;
	cin>>a[0].a>>a[1].a>>a[2].a;
	sort(a,a+3);
	for(int i=0;i<3;i++){
		if(a[i].b==1) cout<<i+1<<endl;
	}
	for(int i=0;i<3;i++){
		if(a[i].b==2) cout<<i+1<<endl;
	}
	for(int i=0;i<3;i++){
		if(a[i].b==3) cout<<i+1<<endl;
	}
}

Submission Info

Judge Result