Codeforces Round #656 (Div. 3), problem: (A) Three Pairwise Maximums

https://codeforces.com/contest/1385/problem/A

LANG : MS C++ 2017

#include <cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int T, num[3];
	scanf_s("%d",&T);
	while(T--){
		scanf_s("%d %d %d", &num[0], &num[1], &num[2]);
		sort(num, num + 3);
		if (num[1]!=num[2]) {
			printf("NO\n");
		}
		else{
			printf("YES\n%d %d %d\n", num[0], num[0], num[2]);
		}
	}
	return 0;
}