-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhit.cpp
More file actions
66 lines (55 loc) · 1.1 KB
/
Copy pathhit.cpp
File metadata and controls
66 lines (55 loc) · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//
// hit.cpp
// codechef
//
// Created by Tanishq Chamola on 26/10/19.
// Copyright © 2019 Tanishq Chamola. All rights reserved.
//
#include <iostream>
#include <algorithm>
using namespace std;
/*
int main()
{
int t;
cin>>t;
while(t--)
{
int n,x,y,z;
cin>>n;
int arr[n];
for (int i=0; i<n; i++)
{
cin>>arr[i];
}
int partition = n/4;
sort(arr,arr+n);
if(arr[(3*partition)-1]!=arr[(3*partition)])
{
z=arr[(3*partition)];
}
else{
cout<<-1<<endl;
continue;
}
if(arr[(2*partition)-1]!=arr[(2*partition)])
{
y=arr[(2*partition)];
}
else{
cout<<-1<<endl;
continue;
}
if(arr[partition-1]!=arr[partition])
{
x=arr[partition];
}
else{
cout<<-1<<endl;
continue;
}
cout<<x<<" "<<y<<" "<<z<<endl;
}
return 0;
}
*/