Cod sursa(job #1701905)
Utilizator | Data | 14 mai 2016 12:46:31 | |
---|---|---|---|
Problema | Loto | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2014, Anul I | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("loto.in");
ofstream out ("loto.out");
int v[101],c[101];
int main()
{
int n,s,i;
in>>n>>s;
for(i=1;i<=n;i++)
in>>v[i],c[i]=v[i];
sort(c+1,c+n+1);
if(c[max_element(c+1,c+n+1)-c]*6<s)
out<<-1;
return 0;
}